Explore a comprehensive talk from Crypto 2011 on optimal structure-preserving signatures in asymmetric bilinear groups. Delve into pairing-based cryptography and bilinear group concepts before examining structure-preserving signatures with generic signers. Analyze lower bounds, proof overviews, and the impossibility of unilateral signatures and single verification equations. Investigate why signatures with only two group elements are not feasible, and learn about optimal structure-preserving signatures. Conclude with additional findings and a summary of this cryptographic research presented by authors Masayuki Abe, Miyako Ohkubo, Jens Groth, and Kristiyan Haralambiev.
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Overview
Syllabus
Intro
Pairing-based cryptography
Bilinear group
Structure-preserving signatures with generic signer
Lower bound
Proof overview
Unilateral signatures are impossible
A single verification equation is impossible
No signature with 2 group elements
Optimal structure-preserving signatures
Further results
Summary
Taught by
TheIACR
