Toward Hierarchical Identity-Based Encryption

By Jeremy Horwitz, Ben Lynn. International Conference on the Theory and Application of Cryptographic Techniques, 2002

601 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/209d9146f12b2c762809fc3b84de4c918fec5cea

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

1. Brent Waters
2. Dan Boneh
3. Allison Bishop
4. Amit Sahai
5. Xavier Boyen
6. Craig Gentry
7. Shai Halevi
8. Chris Peikert

In Information Systems

1. Brent Waters
2. Dan Boneh
3. Xavier Boyen
4. Allison Bishop
5. Craig Gentry
6. Amit Sahai
7. Jonathan Katz
8. Shai Halevi

Citations in the corpus

• Chosen-Ciphertext Security from Identity-Based Encryption (2004, methodology): “Algebraic constructs of the appropriate type are known to exist based on some specific assumptions, namely the hardness of the decisional Diffie-Hellman problem [ cs98 ] or the hardness of deciding quadratic residuosity or N th residuosity in certain groups [ cs02 ].”
• Hierarchical ID-Based Cryptography (2002, background): “In this section, we give some deflnitions similar to those given in [5,6, 12 ].”
• A Forward-Secure Public-Key Encryption Scheme (2003, methodology): “As in [6, 14 , 12], we may apply the transformation due to Fujisaki and Okamoto [11] to obtain a scheme which is forward-secure under adaptive chosen-ciphertext attacks.”
• Efficient Identity-Based Encryption Without Random Oracles (2005, methodology): “Recent results of Canetti et al. [10], further improved upon by Boneh and Katz [6], show how to build a CCA-secure Identity-Based encryption scheme from a 2-level HIBE scheme.”
• Aggregate and Verifiably Encrypted Signatures from Bilinear Maps (2003, methodology): “Thus, our construction is an example where the bilinear map provides extra functionality beyond a simple algorithm for solving DDH. Bilinear maps were previously used for three-way Diffie-Hellman [16], Identity-Based Encryption (IBE) [5], and Hierarchical IBE [15,13].”
• Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys (2007, result): “One interesting open problem would be to construct an IBBE system with constant size ciphertexts and private keys that is secure under a more standard assumption, or which achieves a stronger security notion, equivalent to full security in IBE schemes.”
• Secure attribute-based systems (2006, background): “Techniques from hierarchical identity-based cryptography (HIBE) [18,20,24] or advances in the cryptographic primitives [6] may help to alleviate the policy and management complexity issues discussed above.”
• DACC: Distributed Access Control in Clouds (2011, background): “We conclude the paper with open problems in Section VII.”
• jPBC: Java pairing based cryptography (2011, background): “Extending the basic idea leads to identity-based schemes with additional useful properties such as authenticated or hierarchical identity-based encryption [5], [ 6 ].”
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, background): “Hierarchical Identity Based Encryption (HIBE) [23,26] expands the functionality of identity based encryption to include a hierarchical structure on identities, where identities can delegate secret keys to their subordinate identities.”
• New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, methodology): “This concept was extended to the notion of hierarchical identity-based encryption (HIBE) by Horwitz and Lynn [20], and this was first constructed by Gentry and Silverberg [17].”
• Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography) (2003, methodology): “These include various IB signature schemes [22,16,8], key agreement [25], a 2-level hierarchical IB encryption [17], and a general hierarchical IB encryption that can also be used to produce signatures [15].”
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE (2010, methodology): “Hierarchical identity based encryption (HIBE) is a public key encryption scheme where entities are arranged in a directed tree [HL02,GS02].”
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, methodology): “Other examples of encryption systems with more “structure” added include Hierarchical Identity-Based Encryption [28, 25] and Wildcard IBE [2].”
• Attribute-based encryption for fine-grained access control of encrypted data (2006, background): “We brie.y outline how we can achieve e.cient CCA-2 security and realize the Hierarchical Identity-Based Encryp­tion by applying delegation techniques to the large universe construction.”
• Bonsai Trees, or How to Delegate a Lattice Basis (2010, background): “For example, the more general notion of hierarchical IBE [33, 26] permits multiple levels of secret-key authorities.”