Practical Identity-Based Encryption Without Random Oracles

By Craig Gentry. International Conference on the Theory and Application of Cryptographic Techniques, 2006

845 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/4987aaf293f1715aeda9387f832e3630a79fe74b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

A Survey of Provably Secure Searchable Encryption (2014, methodology): “The authors give a generic construction and a concrete instantiation using an anonymous IBE by Gentry [2006] and the tag-KEM/DEM (key/data encapsulation mechanism) by Kurosawa-Desmedt [2004].”
Efficient Lattice (H)IBE in the Standard Model (2010, methodology): “For pairing-based systems, the structure of pairing groups enabled several secure IBE systems in the standard model [16, 8, 9, 38, 23, 39].”
Decentralizing Attribute-Based Encryption (2011, methodology): “Other standard model solutions followed [20, 9, 10, 52, 27], along with extensions to the hierarchical IBE setting [34, 28, 11].”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, background): “The q-aBDH assumption also appears in [24] where it is called truncated q-ABDHE.”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, background): “In [17], Gentry proposed the first IBE system that is fully secure without random oracles, has short public parameters and has a tight security reduction.”
Functional Encryption: Definitions and Challenges (2011, positive): “Subsequent schemes were proven secure in the standard model, but under a weaker notion known as selective security [CHK03, BB04a], and further subsequent systems were proven adaptively secure [BB04b, Wat05, Gen06 ].”
Simple Functional Encryption Schemes for Inner Products (2015, background): “Examples of those schemes are Anonymous Identity-Based Encryption (AIBE) [BF01, Gen06], Hidden Vector Encryption [BW07] and Orthogonality [KSW08,LOS + 10,OT12], among the others.”
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, background): “Some of the roots of ABE can be traced back to Identity-Based Encryption [36] [13] [23] [18] [10] [41] [24] [14] (IBE).”
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (2005, methodology): “This problem was solved independently by Gentry [ 14 ] and by Boyen and Waters [11].”
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts (2010, methodology): “…Bilinear Diffie-Hellman assumption (d-BDH), but it had public parameters consisting of O(λ) group elements for security parameter λ. Gentry [9] constructed an IBE system with short public parameters and proved full security in the standard model, but used an assumption (q-ABHDE) which is…”
Chosen-Ciphertext Security from Identity-Based Encryption (2004, methodology): “The conversion of any such IBE scheme to a CCA-secure public-key encryption scheme proceeds as follows: The public key of the new scheme is simply the master public key of the IBE scheme, and the secret key is the corresponding master secret key.”
Data Security and Privacy Protection for Cloud Storage: A Survey (2020, methodology): “Boyen [10] got the chosen security of IBE system under the standard model, and the full security IBE scheme was studied by [11], [37], [85].”
Hierarchical Predicate Encryption for Inner-Products (2009, background): “The notion of predicate encryption (PE) was explicitly presented by Katz, Sahai and Waters [16] as a generalized (ﬁne-grained) notion of encryption that covers identity-based encryption (IBE) [2,3,5,9,10,15], hidden-vector encryption (HVE) [7] and attribute-based encryption (ABE) [1,13,19,20,21].”
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009, background): “Moving beyond the partitioning paradigm To overcome these obstacles, Gentry [15] proposed an IBE system with short public parameters that has a security reduction which moves beyond the partitioning paradigm.”
Bonsai Trees, or How to Delegate a Lattice Basis (2010, result): “In contrast, recent works have achieved tight reductions (and even small keys, in some cases) for pairing-based (H)IBEs under various assumptions [23, 24, 57], and a variant of the GPV IBE (in the random oracle model) also has a tight reduction, but their approaches do not seem to translate to our s”
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, background): “Subsequent constructions of IBE and HIBE can be found in [11] [6] [7] [8] [15] [16] [24] [1] [12] [26].”