Hierarchical Identity Based Encryption with Constant Size Ciphertext

By Dan Boneh, Xavier Boyen, Eu-Jin Goh. 2005

1,517 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

Pinocchio: Nearly Practical Verifiable Computation (2013, neutral): “In terms of security, GGPR [30] show this VC scheme is sound under the d-PKE and q-PDH assumptions (see Appendix A), which are weak versions of assumptions in prior work [21, 35, 36].”
Ciphertext-Policy Attribute-Based Encryption (2007, methodology): “Instead, we devise a novel private key randomization technique that uses a new two-level random masking methodology.”
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, methodology): “A generic construction of an identity-based encryption scheme with wildcards (called WIBE for short) from any HIBE scheme has been proposed [2].”
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].”
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts (2010, background): “Our construction again uses composite order groups of order N = p 1 p 2 p 3 , and looks almost exactly like the Boneh-Boyen-Goh HIBE system with keys additionally randomized in subgroup G p 3 .”
A Survey of Homomorphic Encryption for Nonspecialists (2007, methodology): “One more promising direction is the use of the pairing-based scheme proposed by Boneh and Franklin [61] to obtain a secure homomorphic ID-based scheme (see directions in [62] for the ability of such schemes to provide interesting new features).”
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].”
Quadratic Span Programs and Succinct NIZKs without PCPs (2013, methodology): “7 Also, the bilinear group version of our q-PDH assumption is very similar to, but weaker than, assumptions that were used to construct hierarchical identity-based encryption and broadcast encryption schemes with short ciphertexts [11, 13].”
Chosen-Ciphertext Security from Identity-Based Encryption (2004, methodology): “Using this approach with known HIBE schemes [17, 7, 8, 56, 9 ] yields the rst ecien t constructions of CCA-secure IBE schemes.”
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, methodology): “The first efficient HIBE scheme to be provably secure without random oracles is the “BB1” system of Boneh and Boyen; further improvements include the HIBE scheme by Boneh, Boyen, and Goh [7], which features shorter ciphertexts and private keys.”
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (2005, background): “In the second scheme, the key and ciphertext have size polynomial in the number of trapdoors that can be securely issued to the gateway.”
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, methodology): “In our full version [42] we give a construction provably secure under the existing d-BDHE assumption introduced by Boneh, Boyen and Goh [11].”
Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys (2007, methodology): “We refer to [1] for a proof that (P,Q, F )-GDHE and (P,Q, F )-GDDHE have generic security when F 6∈ 〈P,Q〉.”
Multi-Dimensional Range Query over Encrypted Data (2007, background): “In particular, the HIBE scheme proposed by Boneh, Boyen, and Goh [8] can be extended to multiple dimensions (M-HIBE) efﬁciently and in a collusion-resistant 1 manner.”