Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles

By Dan Boneh, Xavier Boyen. IACR Cryptology ePrint Archive, 2004

1,797 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/55886865782939a467d506bdaf7abecab65ede5a

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

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].”
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (2005, methodology): “The following theorems claim the security of the scheme in the random oracle model under the same irreflexivity assumption as Boyen’s scheme [11]: the signature/encryption algorithm is assumed to always take distinct identities as inputs (in other words, a principal never encrypts a message bearing ”
Chosen-ciphertext secure proxy re-encryption (2007, background): “Halevi, and Katz [10] and Boneh and Boyen [7].”
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009, methodology): “Furthermore, our system combines the structure of the Boneh-Boyen [2] selective-ID HIBE.”
A Verifiable Random Function with Short Proofs and Keys (2005, methodology): “(q-DHI assumption) We say that (t, q, ǫ)-DHI assumption holds in G if, no t-time algorithm A has advantage at least ǫ in solving the q-DHI problem in G. Boneh and Boyen [BB04a] pointed out that the q-DHI assumption implies the (q + 1)-generalized Diffie-Hellman assumption (GDH), on which many crypto”
Constant-Size Commitments to Polynomials and Their Applications (2010, background): “Security of two additional properties of the schemes require a generalization of the t-Diffie-Hellman inversion (t-DHI) assumption [28, 5], and the bilinear version of t-SDH, the t-BSDH assumption [21].”
Fuzzy Identity-Based Encryption (2005, background): “Recall that we wish to create an IBE scheme in which a ciphertext created using identity ω can be decrypted only by a secret key ω (cid:2) where | ω ∩ ω (cid:2) | ≥ d .”
Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (2011, background): “A weaker notion called selective security [13, 6] can be defined as in the above game with the exception that the adversary A has to choose the challenge ciphertext index Y before the setup phase but private key queries X1, .”
Attribute-based encryption for circuits (2013, methodology): “The construction as stated achieves the weaker notion of selective security, but we can easily obtain a fully secure scheme following [10] (but using sub-exponential hardness in a crucial way):”
Efficient Lattice (H)IBE in the Standard Model (2010, methodology): “Recall that Waters [38] showed how to convert the selectively-secure IBE in [8] to an adaptively secure IBE.”
Bounded Ciphertext Policy Attribute Based Encryption (2008, methodology): “This model can be seen as analogous to the selective-ID model [5–7] used in identity-based encryption (IBE) schemes [8–10].”
Multi-Dimensional Range Query over Encrypted Data (2007, background): “(a) Encryption under the point x = (3, 5) and the keys released for the range[2, 6]× [3, 7].”
Direct chosen ciphertext security from identity-based techniques (2005, methodology): “IBE schemes secure without random oracles [27, 3].”
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].”
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].”