Abstract
Structure preservation captures the notion of pairing-based schemes that rely on generic group operations and where the components are group elements. Their structural properties make it easy to compose them with other pairing-based schemes.
In this talk, we will take a closer look at structure-preserving signatures. The structure preserving property allows us to analyze the efficiency of signature schemes in the generic group model. Using the generic group model to analyze the efficiency of a cryptographic scheme stands in contrast to the more common usage of the generic group model to rule out certain types of attack. We will show that structure-preserving signatures need to consist of at least 3 group elements.
We also discuss recent constructions of structure-preserving signatures that consist of 3 group elements. These constructions match our lower bounds, thus giving us provably optimal structure-preserving signatures.
Chapter PDF
Similar content being viewed by others
Keywords
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Groth, J. (2011). Optimal Structure-Preserving Signatures. In: Boyen, X., Chen, X. (eds) Provable Security. ProvSec 2011. Lecture Notes in Computer Science, vol 6980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24316-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-24316-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24315-8
Online ISBN: 978-3-642-24316-5
eBook Packages: Computer ScienceComputer Science (R0)