Paper Info
Title
The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
Abstract
In pairing-based cryptography the Generic Group Model (GGM) is used frequently to provide evidence towards newly introduced hardness assumptions. Unfortunately, the GGM does not reflect many known properties of bilinear group settings and thus hardness results in this model are of limited significance. This paper proposes a novel computational model for pairing-based cryptography, called the Semi-Generic Group Model (SGGM), that is closer to the standard model and allows to make more meaningful security guarantees. In fact, the hest algorithms currently known for solving pairing-based problems are semi-generic in nature. We demonstrate the usefulness of our new model by applying it to study several important assumptions (BDDH, Co-DH). Furthermore, we develop master theorems facilitating an easy analysis of other (future) assumptions. These master theorems imply that (unless there are better algorithms than the semi-generic ones) great parts of the zoo of novel assumptions over bilinear groups are reducible to just two (more or less) standard assumptions over finite fields. Finally, we examine the appropriateness of the SGGM as a tool for analyzing the security of practical cryptosystems without random oracles by applying it to the BLS signature scheme.
Year
DOI
Venue
2010
10.1007/978-3-642-17373-8_31
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010
Keywords
Field
DocType
Restricted models of computation,generic groups,semi-generic group model,cryptographic assumptions,master theorems,provable security,pairingbased cryptography
Discrete mathematics,Pairing-based cryptography,Computer science,Cryptography,Generic group model,Cryptosystem,Theoretical computer science,Pairing,Standard model (cryptography),Provable security,Bilinear interpolation
Conference
Volume
ISSN
Citations 
6477
0302-9743
5
PageRank 
References 
Authors
0.40
33
2
Name
Order
Citations
PageRank
Tibor Jager142027.65
Andy Rupp219616.95