Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
By Brent Waters. International Conference on Theory and Practice of Public Key Cryptography, 2011
2,250 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/baf9cea3c0f2dde4971948258c76762e977aaaf1
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
- Dan Boneh
- Benoît Libert
- Kui Ren
- Katsuyuki Takashima
- Tatsuaki Okamoto
In Computational Theory and Mathematics
- Brent Waters
- Allison Bishop
- Amit Sahai
- Benoît Libert
- Katsuyuki Takashima
- Tatsuaki Okamoto
- Dan Boneh
- Nuttapong Attrapadung
Citations in the corpus
- Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption (2012, methodology): “The CP-ABE schemes given in SW05 [23], BSW07 [4], Waters11 [24] and LOSTW10 [13] allow for elementary ciphertext manipulations.”
- DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems (2013, methodology): “We recall the de fi nition of the decisional q-parallel Bilinear Dif fi e-Hellman Exponent (q-parallel BDHE) problem in [5] as follows.”
- Security and Privacy in Smart Health: Efficient Policy-Hiding Attribute-Based Access Control (2018, methodology): “Based on the CP-ABE scheme [32] and the Garbled bloom filter [47], Yang et al.”
- Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud (2013, background): “By setting a group with a single attribute, Lu et al. [7] proposed a secure provenance scheme based on the ciphertext-policy attribute-based encryption technique [8], which allows any member in a group to share data with others.”
- Attribute-Based Signatures (2011, methodology): “Also, we show how our techniques allow us to extend Groth-Sahai NIZK proofs to be simulation-extractable and identity-based with low overhead.”
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “Selectively secure CP-ABE and KP-ABE systems were constructed in [34,25,18,5,32,24, 39 ].”
- Charm: a framework for rapidly prototyping cryptosystems (2013, methodology): “…encryption Pairing ROM a 69 SW05 [69] Fuzzy identity-based encryption Pairing Standard 68 BSW07 [14] Attribute-based encryption Pairing ROM a 62 Waters08 [77] Attribute-based encryption Pairing ROM a 61 LW10 [58] DFA-based functional encryption Pairing Standard 71 HVE08 [53] Hidden vector…”
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption (2010, background): “FE has various applications in the areas of access control for databases, mail services, and contents distribution [3, 8, 10, 17, 18, 23, 24, 25, 26, 28].”
- Improving privacy and security in multi-authority attribute-based encryption (2009, background): “Recently, [15] proposed CP-ABE constructions based on a few different pairing assumptions which work for any access policy that can be expressed in terms of an LSSS matrix.”
- Functional Encryption: Definitions and Challenges (2011, methodology): “4 The ABE solutions of Goyal et. al. and others [BSW07, OSW07, GJPS08, Wat11 ] actually”
- Secret-Sharing Schemes: A Survey (2011, background): “, Byzantine agreement [54], secure multiparty computations [13, 24, 28], threshold cryptography [31], access control [52], attribute-based encryption [40, 68], and generalized oblivious transfer [59, 65].”
- Data Security and Privacy-Preserving in Edge Computing Paradigm: Survey and Open Issues (2018, methodology): “Sahai and Waters [72] proposed the basic Attribute-Based Encryption (fuzzy IBE) as a re-construction of IBE scheme in which the identities are replaced of a set attributes.”
- Secure provenance: the essential of bread and butter of data forensics in cloud computing (2010, neutral): “ProveTrack: Once the data M decrypted from C is in dispute, SP can track the σA||Y ||χ with the clue (sig, Y ) (1)Note that this kind of encryption technique can be regarded as some kind of single attribute-based encryption [21].”