Bounded Ciphertext Policy Attribute Based Encryption
By Vipul Goyal, Abhishek Jain, Omkant Pandey, Amit Sahai. International Colloquium on Automata, Languages and Programming, 2008
650 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/4e96e50b9e696ffb48d852d7a9b1556b211674f1
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
- Dan Boneh
- Amit Sahai
- Vinod Vaikuntanathan
- Benoît Libert
- Katsuyuki Takashima
- Tatsuaki Okamoto
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
- Attribute-Based Encryption With Verifiable Outsourced Decryption (2013, neutral): “[7] VipulGoyal, Abishek Jain, OmkantPandey, and AmitSahai.”
- Unbounded HIBE and Attribute-Based Encryption (2011, neutral): “[8,21,27,28,38,39,46]).”
- A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, methodology): “Although previous CP-ABE schemes [5, 15, 17, 25, 32] can complement our access structures, the length of the ciphertext depends on the number of attributes.”
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, background): “Selectively secure CP-ABE and KP-ABE systems were constructed in [34, 25, 18, 5, 32, 24, 39].”
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts (2011, background): “As an intermediate step towards the new non-monotonic ABE, we design a new identity-based revocation (IBR) mechanism (as defined by Lewko, Sahai and Waters [24]) with O(1)-size ciphertexts and a similar structure to that of the monotonic KP-ABE schemes provided by our general construction.”
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, background): “In the GJPS construction and our d-BDH one of Section 5 the systems define nmax as a bound on the size any formula.”
- Secure threshold multi authority attribute based encryption without a central authority (2008, methodology): “After that, how to convert a key policy based ABE scheme to ciphertext policy based ABE scheme is presented in ICALP2008 [9].”
- Reusable garbled circuits and succinct functional encryption (2013, background): “We remark that functional encryption (FE) arises from, and generalizes, a beautiful sequence of papers on attribute-based encryption (including [7, 32, 33, 35, 36, 48, 54, 55]), and more generally predicate encryption (including [10, 34, 40]).”
- Conjunctive Broadcast and Attribute-Based Encryption (2009, background): “Goyal et al. [ 15 ] presented bounded CP-ABE in the standard model.”
- Functional Encryption: Definitions and Challenges (2011, methodology): “CP-ABE systems are constructed in [BSW07, GJPS08 , Wat11].”
- Attribute-based signature and its applications (2010, background): “For instance, the most e.cient transform from ABE to CP-ABE [13] increases the encryption and decryption complexities in the worst case by O(n 3.42), where n is the size of the access formula.”
- Decentralizing Attribute-Based Encryption (2011, background): “Since then, several different ABE systems have been proposed [8,21,23,29,44,54,22], as well as related systems [14,2].”
- Outsourcing the Decryption of ABE Ciphertexts (2011, background): “Since the introduction of ABE there have been several other works proposing different variants [24, 7, 14, 36, 23, 42, 15, 28, 35] extending both functionality and refining security proof techniques.”
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques (2012, background): “There have been several prior constructions of attribute-based encryption which have been shown to be selectively secure in the standard model [30, 19, 13, 29, 18, 34] or proven secure in the generic group model [5] (this is a heuristic model intended to capture an attacker who can only access group”