Secure Identity Based Encryption Without Random Oracles

By Dan Boneh, Xavier Boyen. 2004

626 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

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

Bonsai Trees, or How to Delegate a Lattice Basis (2010, methodology): “Note that our definition of admissibility is conceptually different from that of [9].”
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].”
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, background): “Since 2001, several schemes have been introduced [14, 26, 12, 8, 7, 6, 17].”
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].”
Multi-Dimensional Range Query over Encrypted Data (2007, background): “(b) Encryption under the point x = 3 and the keys released for the range [3, 7].”
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “While this partitioning strategy was successfully employed by Boneh and Boyen [7], and Waters [38] to prove full security for an IBE system, any partitioning approach seems doomed to failure when one tries to achieve full security for ABE systems.”
Unbounded HIBE and Attribute-Based Encryption (2011, methodology): “[11, 10, 45, 34] fall roughly into this framework).”
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008, background): “Identitybased encryption (IBE) [21,8,13,4, 5 ,23] can be viewed as predicate encryption for the class of equality tests; the standard notion of security for IBE [8,12] corresponds to payload-hiding, while anonymous IBE [7,11,14] corresponds to the stronger notion of attribute hiding.”
Efficient Noninteractive Proof Systems for Bilinear Groups (2008, background): “The most notable of these is the Identity-Based Encryption scheme of Boneh and Franklin [10] (see also [6,7,35]), and there are many others, such as AttributeBased Encryption [32,22], Searchable Public-Key Encryption [9,12,13], and One-time Double-Homomorphic Encryption [11].”
Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014, methodology): “Security of zk-SNARKs is based on knowledge-of-exponent assumptions and variants of Diffie–Hellman assumptions in bilinear groups [5,49,55].”
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption (2010, neutral): “When R is the simplest relation or equality relation, i.e., R(x, v) holds iff x = v, it is identity-based encryption (IBE) [3–6, 10, 12, 13, 15].”
Data Security and Privacy Protection for Cloud Storage: A Survey (2020, methodology): “Soon afterwards many scholars improved the IBE. Boneh and 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].”
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, methodology): “This proof technique was previously used in the context of identity-based encryption [9] [11] [6] [7] [34].”
Functional Encryption: Definitions and Challenges (2011, neutral): “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].”
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009, methodology): “One might view the HIBE system as " combining " the structure of the Boneh-Boyen [2] HIBE system with our techniques to get full security.”