Abstract
The generic group model (GGM) is used frequently to provide evidence towards newly introduced hardness assumptions. In particular in the area of pairing-based cryptography numerous novel assumptions have been introduced over the last decade. Unfortunately, the GGM does not reflect many known properties of bilinear group settings. Not at least currently known algorithms for solving computational problems over bilinear groups are captured, and thus hardness results in this model are of limited significance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Jager, T. (2012). Semi-Generic Groups and Their Applications. In: Black-Box Models of Computation in Cryptology. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-8348-1990-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-8348-1990-1_6
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-8348-1989-5
Online ISBN: 978-3-8348-1990-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)