All Outputs (3)

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.