Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
By Brent Waters. IACR Cryptology ePrint Archive, 2009
902 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/58d1ea2ca622332b68d72ec94a7f97b4a473ccf2
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
- Brent Waters
- Allison Bishop
- Vinod Vaikuntanathan
- Amit Sahai
- Dan Boneh
- Chris Peikert
- Robert Huijie Deng
- Shai Halevi
In Computational Theory and Mathematics
- Brent Waters
- Allison Bishop
- Amit Sahai
- Vinod Vaikuntanathan
- Chris Peikert
- Robert Huijie Deng
- Shai Halevi
- Katsuyuki Takashima
Citations in the corpus
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups (2010, background): “, [20, 33]), namely, that functionality that can be achieved in composite-order groups under the subgroup decision assumption can also be achieved in prime-order groups under either the DDH or the decision linear assumption.”
- Outsourcing the Decryption of ABE Ciphertexts (2011, methodology): “8 Recently, the first ABE systems that achieved adaptive security were proposed by Lewko et al. [28] using the techniques of Dual System Encryption [41].”
- Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control (2018, methodology): “[11] proposed the first fully secure CP-ABE scheme, which is proven secure based on the dual system encryption methodology [48] in the standard model.”
- Unbounded HIBE and Attribute-Based Encryption (2011, methodology): “[11, 10, 45, 34] fall roughly into this framework).”
- Bonsai Trees, or How to Delegate a Lattice Basis (2010, methodology): “This simulation approach (dubbed ‘partitioning strategy’ in [57]) involves, to a certain extent, guessing the adversary’s user secret key and challenge queries.”
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, methodology): “The dual system encryption methodology has previously been implemented both in prime order bilinear groups (e.g. in [35] [29]) and in composite order bilinear groups (e.g. in [24] [23]).”
- Decentralizing Attribute-Based Encryption (2011, methodology): “Their system applied the dual system encryption methodology introduced by Waters [53] and techniques used by Lewko and Waters [39].”
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption (2010, methodology): “Proof Outline : At the top level of strategy of the security proof, we follow the dual system encryption methodology proposed by Waters [28].”
- Attribute-based encryption for circuits (2013, background): “In the past few years, there has been significant progress in attribute-based encryption in terms of efficiency, security guarantees, and diversifying security assumptions [1, 16, 27, 29, 30, 35, 45].”
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “At the top level of strategy of the security proof, we follow the dual system encryption methodology proposed by Waters [40].”