Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

By Xavier Boyen, Brent Waters. Annual International Cryptology Conference, 2006

521 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/972a9384441a7609ba5f81d33df2f316de8db3c2

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

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE (2010, methodology): “The first HIBE constructions, with and without random oracles, were based on bilinear maps [GS02, BB04, BW06 , BBG05, GH09, Wat09].”
Hierarchical Predicate Encryption for Inner-Products (2009, methodology): “Since HPE is a generalized (ﬁne-grained) version of anonymous HIBE (AHIBE) (or includes AHIBE as a special case), HPE covers (a generalized version of) applications described in [8], fully private communication and search on encrypted data.”
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (2005, background): “Now consider the following experiments, where b ∈ {0, 1} is a bit: Experiment Expibe-ind-cpa-bIBE,A (k) IDSet ← ∅ ; (pk ,msk) $← Setup(1k) Pick random oracle H (id , M0, M1, st) $← AKeyDer,H(find, pk) C $← EncH(pk , id , Mb) b′ $← AKeyDer,H(guess,C , st) If {M0, M1} ⊆ MsgSp(k) then return 0 If id ∈ ”
Multi-Dimensional Range Query over Encrypted Data (2007, background): “The Decision Linear assumption, ﬁrst proposed by Boneh, Boyen and Shacham for group signatures [9], posits the hardness of the following problem: , where z 1 , z 2 , z 3 , z 4 are picked at random from Z p , decide whether Z = g z 3 + z 4 .”
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009, methodology): “We believe that our Dual System methodology in the future will become a catalyst for proving adaptive security under simple assumptions for several other encryption systems including: Anonymous IBE and searchable encryption [4, 1, 10, 9, 24], Broadcast Encryption [14, 7], and Attribute-Based Encrypt”
Structured Encryption and Controlled Disclosure (2010, background): “Searchable encryption has also been considered in the public-key setting [5, 36, 1, 10, 7, 9].”
Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, background): “A related line of work called predicate encryption or searching on encrypted data attempts to evaluate predicates over the encrypted data itself [39, 12, 1, 16, 15, 37, 29].”
Conjunctive, Subset, and Range Queries on Encrypted Data (2007, methodology): “Equality tests in the public key settings are closely related to Anonymous Identity Based Encryption (AnonIBE) [8] [1] [13].”
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption (2010, unknown): “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].”
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, background): “For example, in Identity-Based Encryption (IBE) schemes such as [9, 12], an encryptor can restrict a decryptor to indicate the identity of the decryptor.”
Practical Identity-Based Encryption Without Random Oracles (2006, background): “Boyen and Waters recently presented the first such anonymous IBE system at the rump session of Crypto 2005 (see [14]).”
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, background): “Since HPE is a generalized (ﬁne-grained) version of anonymous HIBE (AHIBE) (or includes AHIBE as a special case), HPE covers (a generalized version of) applications described in [13], fully private communication and search on encrypted data.”
Bonsai Trees, or How to Delegate a Lattice Basis (2010, background): “This notion is more appropriate than standard IBE for large organizations, can isolate damage in the case of secret-key exposure, and has further applications such as forwardsecure encryption [16] and broadcast encryption [21, 58].”
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, background): “In our setting, the intractability of -wDBDHI can be classified among mild decisional assumptions (according to the terminology of [18]) as its strength does not depend on the number of queries allowed to adversaries.”
Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (2008, methodology): “Finally to make it hard to distinguish the well-formed components from the malformed components, we use the linear splitting technique in [6,21] and make our first construction provably secure as shown in Sect.”
Predicate Privacy in Encryption Systems (2009, background): “The earliest examples of public-key predicate encryption are anonymous identity-based encryption (A-IBE) schemes with keyword search (which corresponds to an equality predicate) [7, 12, 1, 9].”
A Survey of Provably Secure Searchable Encryption (2014, unknown): “Or imagine that your trusted storage provider sells its business to a company that you do not trust, and which will have full access to your data.”
Practical Private Set Intersection Protocols with Linear Complexity (2010, methodology): “It enhances PEKS by introducing a Committed Blind Anonymous IBE scheme.”