Essam Ghadafi's Outputs (5)

Towards a classification of non-interactive computational assumptions in cyclic groups (2017)
Presentation / Conference Contribution

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)
Presentation / Conference Contribution

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.

Attribute-based signatures with user-controlled linkability without random oracles (2017)
Book Chapter

Attribute-Based Signatures (ABS) are a versatile cryptographic primitive and have many applications. They are a generalization of many widely-used signature-related notions such as group, ring and mesh signatures.
Attribute-Based Signatures with U... Read More about Attribute-based signatures with user-controlled linkability without random oracles.

More efficient structure-preserving signatures - or: Bypassing the type-III lower bounds (2017)
Presentation / Conference Contribution

© 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

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.