Attribute-based encryption with non-monotonic access structures

By Rafail M. Ostrovsky, Amit Sahai, Brent Waters. Conference on Computer and Communications Security, 2007

1,228 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/bf25d9ca8eec88f515932fc7645c8ecc4e3e93b2

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

1. Brent Waters
2. Allison Bishop
3. Amit Sahai
4. Dan Boneh
5. Katsuyuki Takashima
6. Tatsuaki Okamoto
7. Benoît Libert
8. Nuttapong Attrapadung

In Computational Theory and Mathematics

1. Brent Waters
2. Allison Bishop
3. Amit Sahai
4. Benoît Libert
5. Katsuyuki Takashima
6. Tatsuaki Okamoto
7. Nuttapong Attrapadung
8. Dan Boneh

Citations in the corpus

• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010, methodology): “Predicate encryption (PE) for inner products was presented by Katz, Sahai and Waters [27] as a generalized (fine-grained) notion of encryption that covers identity-based encryption (IBE) [6,7,9,19,21,26], hidden-vector encryption (HVE) [12] and attribute-based encryption (ABE) [5,25, 32 ,33,34].”
• Improving privacy and security in multi-authority attribute-based encryption (2009, neutral): “If it turns out that this is the author­ity from which the adversary requests insu.cient attributes for user u, then we are all set, and we can simply reuse the Sahai-Waters 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 [31, 19, 13, 30, 18, 36] or proven secure in the generic group model [5] (this is a heuristic model intended to capture an attacker who can only access group”
• Attribute-Based Access Control with Efficient Revocation in Data Outsourcing Systems (2011, neutral): “Indeed, these approaches have two main problems.”
• Data Security and Privacy-Preserving in Edge Computing Paradigm: Survey and Open Issues (2018, methodology): “[75] proposed a KP-ABE scheme with INVERT logic gate based on non-monotonic access structure and broadcast revocation mechanism.”
• Predicate Privacy in Encryption Systems (2009, background): “In attribute-based encryption (ABE) [25, 20, 3, 24, 15, 23], a user can receive a capability representing an access control policy over the attributes of an encrypted record.”
• 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.”
• Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization (2011, methodology): “Most of them have been for monotonic access structures over attributes; one exception is the work of Ostrovsky, Sahai, and Waters [33] that showed how to realize negation by integrating revocation schemes into the GPSW ABE cryptosystem.”
• Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives (2017, methodology): “Building on non-monotonic attribute-based encryption [OSW07], Green and Miers [GM15] proposed puncturable encryption as a way to achieve forward secrecy for instant messaging.”
• Hierarchical Predicate Encryption for Inner-Products (2009, background): “The notion of predicate encryption (PE) was explicitly presented by Katz, Sahai and Waters [16] as a generalized (fine-grained) notion of encryption that covers identity-based encryption (IBE) [2,3,5,9,10,15], hidden-vector encryption (HVE) [7] and attribute-based encryption (ABE) [1,13,19,20,21].”
• Bounded Ciphertext Policy Attribute Based Encryption (2008, methodology): “An encryptor can now use the encryption system closest to the access tree chosen for encryption, thus limiting the ciphertext overhead. For details, see [ 9 ].”
• Secure MQTT for Internet of Things (IoT) (2015, background): “Further in KP-ABE and CP-ABE encryption and decryption depends on key based access policy [7], [14] and ciphertext based access policy [8] respectively.”
• Functional Encryption: Definitions and Challenges (2011, background): “4 The ABE solutions of Goyal et. al. and others [BSW07, OSW07 , GJPS08, Wat11] actually”