Skip to main content

Research Repository

Advanced Search

Outputs (26)

Defending against adversarial machine learning attacks using hierarchical learning: A case study on network traffic attack classification (2022)
Journal Article
McCarthy, A., Ghadafi, E., Andriotis, P., & Legg, P. (2023). Defending against adversarial machine learning attacks using hierarchical learning: A case study on network traffic attack classification. Journal of Information Security and Applications, 72, Article 103398. https://doi.org/10.1016/j.jisa.2022.103398

Machine learning is key for automated detection of malicious network activity to ensure that computer networks and organizations are protected against cyber security attacks. Recently, there has been growing interest in the domain of adversarial mach... Read More about Defending against adversarial machine learning attacks using hierarchical learning: A case study on network traffic attack classification.

Functionality-preserving adversarial machine learning for robust classification in cybersecurity and intrusion detection domains: A survey (2022)
Journal Article
McCarthy, A., Ghadafi, E., Andriotis, P., & Legg, P. (2022). Functionality-preserving adversarial machine learning for robust classification in cybersecurity and intrusion detection domains: A survey. Journal of Cybersecurity and Privacy, 2(1), 154-190. https://doi.org/10.3390/jcp2010010

Machine learning has become widely adopted as a strategy for dealing with a variety of cybersecurity issues, ranging from insider threat detection to intrusion and malware detection. However, by their very nature, machine learning systems can introdu... Read More about Functionality-preserving adversarial machine learning for robust classification in cybersecurity and intrusion detection domains: A survey.

Feature vulnerability and robustness assessment against adversarial machine learning attacks (2021)
Conference Proceeding
Mccarthy, A., Andriotis, P., Ghadafi, E., & Legg, P. (2021). Feature vulnerability and robustness assessment against adversarial machine learning attacks. In 2021 International Conference on Cyber Situational Awareness, Data Analytics and Assessment (CyberSA). https://doi.org/10.1109/CyberSA52016.2021.9478199

Whilst machine learning has been widely adopted for various domains, it is important to consider how such techniques may be susceptible to malicious users through adversarial attacks. Given a trained classifier, a malicious attack may attempt to craf... Read More about Feature vulnerability and robustness assessment against adversarial machine learning attacks.

Partially structure-preserving signatures: Lower bounds, constructions and more (2021)
Conference Proceeding
Ghadafi, E. (2021). Partially structure-preserving signatures: Lower bounds, constructions and more. In K. Sako, & N. O. Tippenhauer (Eds.), In Applied Cryptography and Network Security (284-312). https://doi.org/10.1007/978-3-030-78372-3_11

In this work we first provide a framework for defining a large subset of pairing-based digital signature schemes which we call Partially Structure-Preserving Signature (PSPS) schemes. PSPS schemes are similar in nature to structure-preserving signatu... Read More about Partially structure-preserving signatures: Lower bounds, constructions and more.

Foundations of fully dynamic group signatures (2020)
Journal Article
Bootle, J., Cerulli, A., Chaidos, P., Ghadafi, E., & Groth, J. (2020). Foundations of fully dynamic group signatures. Journal of Cryptology, 33(4), 1822-1870. https://doi.org/10.1007/s00145-020-09357-w

Group signatures allow members of a group to anonymously sign on behalf of the group. Membership is administered by a designated group manager. The group manager can also reveal the identity of a signer if and when needed to enforce accountability an... Read More about Foundations of fully dynamic group signatures.

Further lower bounds for structure-preserving signatures in asymmetric bilinear groups (2019)
Conference Proceeding
Ghadafi, E. (2019). Further lower bounds for structure-preserving signatures in asymmetric bilinear groups. In J. Buchmann, N. Abderrahmane, & R. Tajjeeddine (Eds.), 11th International Conference on Cryptology, AFRICACRYPT 2019. https://doi.org/10.1007/978-3-030-23696-0

Structure-Preserving Signatures (SPSs) are a useful tool for the design of modular cryptographic protocols. Recent series of works have shown that by limiting the message space of those schemes to the set of Diffie-Hellman (DH) pairs, it is possible... Read More about Further lower bounds for structure-preserving signatures in asymmetric bilinear groups.

Towards a classification of non-interactive computational assumptions in cyclic groups (2017)
Conference Proceeding
Ghadafi, E., & Groth, J. (2017). Towards a classification of non-interactive computational assumptions in cyclic groups. In Advances in Cryptology – ASIACRYPT 2017 (66-96). https://doi.org/10.1007/978-3-319-70697-9_3

We study non-interactive computational intractability assumptions in prime-order cyclic groups. We focus on the broad class of computational assumptions, which we call target assumptions, where the adversary's goal is to compute a concrete group elem... Read More about Towards a classification of non-interactive computational assumptions in cyclic groups.

Linear-time zero-knowledge proofs for arithmetic circuit satisfiability (2017)
Conference Proceeding
Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., & Jakobsen, S. K. (2017). Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In Lecture Notes in Computer Science (336-365). https://doi.org/10.1007/978-3-319-70700-6_12

We give computationally efficient zero-knowledge proofs of knowledge for arithmetic circuit satisfiability over a large field. For a circuit with N addition and multiplication gates, the prover only uses O(N) multiplications and the verifier only use... Read More about Linear-time zero-knowledge proofs for arithmetic circuit satisfiability.

More efficient structure-preserving signatures - or: Bypassing the type-III lower bounds (2017)
Conference Proceeding
Ghadafi, E. (2017). More efficient structure-preserving signatures - or: Bypassing the type-III lower bounds. In S. Foley, D. Gollmann, & E. Snekkenes (Eds.), . https://doi.org/10.1007/978-3-319-66399-9_3

© 2017, Springer International Publishing AG. Structure-Preserving Signatures (SPSs) are an important cryptographic primitive that is useful for the design of modular cryptographic protocols. It has be shown that in the most efficient Type-III biline... Read More about More efficient structure-preserving signatures - or: Bypassing the type-III lower bounds.

Efficient round-optimal blind signatures in the standard model (2017)
Book Chapter
Ghadafi, E. (2017). Efficient round-optimal blind signatures in the standard model. In A. Kiayias (Ed.), Financial Cryptography and Data Security (455-473). Malta: Springer Verlag

Blind signatures are at the core of e-cash systems and has numerous other applications. In this work we construct efficient blind and partially blind signature schemes over bilinear groups in the standard model. Our schemes yield short signatures co... Read More about Efficient round-optimal blind signatures in the standard model.