Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
By Allison Bishop, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters. International Conference on the Theory and Application of Cryptographic Techniques, 2010
1,389 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/78b5d3a584db617a57c2092d6c896db29be0b6e4
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
- Amit Sahai
- Kui Ren
- Dan Boneh
- Wenjing Lou
- Vinod Vaikuntanathan
- Robert Huijie Deng
In Computational Theory and Mathematics
- Brent Waters
- Allison Bishop
- Amit Sahai
- Dan Boneh
- Vinod Vaikuntanathan
- Benoît Libert
- Katsuyuki Takashima
- Tatsuaki Okamoto
Citations in the corpus
- Unbounded HIBE and Attribute-Based Encryption (2011, methodology): “The Waters system was efficient and proven from the well-established decisional Bilinear Diffie-Hellman assumption, but had public parameters consisting of O(λ) group elements, where λ is the security parameter.”
- Attribute-Based Encryption With Verifiable Outsourced Decryption (2013, methodology): “There are two kinds of ABE schemes: key-policy ABE (KP-ABE) [2]–[7] and ciphertext-policy ABE (CP-ABE) [8], [9], [5], [6].”
- Practical constructions and new proof methods for large universe attribute-based encryption (2013, background): “Prior fully secure ABE systems [23] required an additional (relative to selective schemes) limit t on the number of times an attribute could be used in a formula.”
- Decentralizing Attribute-Based Encryption (2011, methodology): “Since the introduction of Attribute-Based Encryption, several works [8, 30, 44, 29, 23, 54, 21, 22, 37] have proposed different ABE systems and applications.”
- KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage (2017, neutral): “Two types of ABE schemes, namely key-policy ABE (KPABE) [3], [4], [5], [6], [7], [8] and ciphertext-policy ABE (CP-ABE) [9], [10], [11], [12], [13], [14], [15] are proposed.”
- 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.”
- A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data (2016, methodology): “Due to the special structure of our tree-based index, the proposed search scheme can flexibly achieve sublinear search time and deal with the deletion and insertion of documents.”
- DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems (2013, background): “Ciphertext-Policy Attribute-based Encryption (CP-ABE) [2]–[6] is regarded as one of the most suitable technologies for data access control in cloud storage systems, because it gives the data owner more direct control on access policies and does not require the data owner to distribute keys.”
- Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data (2014, background): “As a more general search approach, predicate encryption schemes [21], [22], [23] are recently proposed to support both conjunctive and disjunctive search.”
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, methodology): “[31] recently leveraged the encoding technique from our work to build an ABE system that achieves adaptive (non-selective) security.”
- Authorized Private Keyword Search over Encrypted Data in Cloud Computing (2011, background): “Later, several multi-keyword search schemes were proposed [19], [5], [11], [33], [21], [32], [22], [34], [13] that enable conjunctive or disjunctive search formulas.”
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption (2012, neutral): “By now, there have been a number of constructions of ABE schemes for var i us classes of functions, the most general being an ABE scheme where F is any function that can be computed by a polynomial-size Boolean formula [16,20].”
- Functional Encryption: Definitions and Challenges (2011, methodology): “2 This class has also been informally referred to as “payload hiding” [BW07, KSW08 ] in the”