Efficient Identity-Based Encryption Without Random Oracles

By Brent Waters. International Conference on the Theory and Application of Cryptographic Techniques, 2005

2,009 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/8e57bad7c2b6d198cfd12318a872d31380913f95

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

In Information Systems

Citations in the corpus

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.”
Pairing-Based Cryptography at High Security Levels (2005, methodology): “h ≈ p/n is usually small; its bitlength is (ρ − 1)bn ,w hereρ =l ogp/ log n is generally between 1 and 2. In the k = 1 case, to avoid the point multiplication by h one might want to use a different identity-based encryption scheme, such as the one in [44] or [ 54 ], where Alice’s public key is an in”
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.”
Security in cloud computing: Opportunities and challenges (2015, methodology): “The SPICE extends the Waters signature [112] and Groth-Sahai proof system [34] for group signature.”
Identity-Based Proxy Re-encryption (2007, methodology): “This assumption is believed to hold in certain groups, and used as the basis of several Identity-Based Encryption schemes, e.g., [4] [18].”
Unbounded HIBE and Attribute-Based Encryption (2011, methodology): “Fully secure solutions in the standard model were later provided by Boneh and Boyen [10] and Waters [44].”
Ring Signatures: Stronger Definitions, and Constructions without Random Oracles (2006, methodology): “Our first scheme is based on the (standard) signature scheme constructed by Waters [23], whereas the second is based on the Camenisch–Lysyanskaya signature scheme [7].”
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].”
Witness encryption and its applications (2013, methodology): “This is very similar to [35] except that we do not have to deal with the issue of artificial aborts.”
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.”
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, methodology): “To this end, ideas from Boyen, Mei and Waters [17] allow for fairly compact ciphertexts as components C1 and become unnecessary if the checksum value C4 is computed using the Waters \hashing" technique [45] applied to a collision-resistant hash of C3. This improvement in the ciphertext size unfortun”
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009, methodology): “Subsequently, Boneh and Boyen [3] and Waters [26] gave fully secure solutions in the standard model.”
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation (2005, methodology): “A more efficient scheme was suggested by Waters in [ 30 ].”
Efficient Lattice (H)IBE in the Standard Model (2010, methodology): “In Section 7 we show that our base construction extends to an adaptively-secure IBE using a lattice analog of the Waters IBE [40].”
Efficient Identity-Based Signatures Secure in the Standard Model (2006, methodology): “Although Shamir proposed the idea of an IBE scheme in 1984, no construction that was both ecient and secure was found until recently, when the work of Boneh and Franklin [ BF01 ] and Cocks [Coc01] was published.”