Attribute-based encryption with non-monotonic access structures
Rafail Ostrovsky, Amit Sahai, Brent R. Waters · Proceedings of the ACM Conference on Computer and Communications Security · 2007
We construct an Attribute-Based Encryption (ABE) scheme that allows a user's private key to be expressed in terms of any access formula over attributes. Previous ABE schemes were limited to expressing only monotonic access structures. We provide a proof of security for our scheme based on the Decisional Bilinear Diffie-Hellman (BDH) assumption. Furthermore, the performance of our new scheme compares favorably with existing, less-expressive schemes.
Cited by 1,059 works. doi:10.1145/1315245.1315270
Authors
References
- How to share a secret
- Identity-Based Cryptosystems and Signature Schemes
- Safeguarding cryptographic keys
- Identity-Based Encryption from the Weil Pairing
- Attribute-based encryption for fine-grained access control of encrypted data
- Ciphertext-Policy Attribute-Based Encryption
- Fuzzy Identity-Based Encryption
- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Chosen-Ciphertext Security from Identity-Based Encryption