All Outputs (8)

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.

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.

Foundations of fully dynamic group signatures (2016)
Conference Proceeding
Bootle, J., Cerulli, A., Chaidos, P., Ghadafi, E., & Groth, J. (2016). Foundations of fully dynamic group signatures. In Applied Cryptography and Network Security (117-136). https://doi.org/10.1007/978-3-319-39555-5_7

Group signatures are a central cryptographic primitive that has received a considerable amount of attention from the cryptographic community. They allow members of a group to anonymously sign on behalf of the group. Membership is overseen by a design... Read More about Foundations of fully dynamic group signatures.

Short accountable ring signatures based on DDH (2016)
Conference Proceeding
Bootle, J., Cerulli, A., Chaidos, P., Ghadafi, E., Groth, J., & Petit, C. (2016). Short accountable ring signatures based on DDH. In Computer Security -- ESORICS 2015 (243-265). https://doi.org/10.1007/978-3-319-24174-6_13

Ring signatures and group signatures are prominent cryptographic primitives offering a combination of privacy and authentication. They enable individual users to anonymously sign messages on behalf of a group of users. In ring signatures, the group,... Read More about Short accountable ring signatures based on DDH.