Ciphertext-Policy Attribute-Based Encryption
Top Cited Papers
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10816011,p. 321-334
- https://doi.org/10.1109/sp.2007.11
Abstract
In several distributed systems a user should only be able to access data if a user posses a certain set of credentials or attributes. Currently, the only method for enforcing such policies is to employ a trusted server to store the data and mediate access control. However, if any server storing the data is compromised, then the confidentiality of the data will be compromised. In this paper we present a system for realizing complex access control on encrypted data that we call ciphertext-policy attribute-based encryption. By using our techniques encrypted data can be kept confidential even if the storage server is untrusted; moreover, our methods are secure against collusion attacks. Previous attribute-based encryption systems used attributes to describe the encrypted data and built policies into user's keys; while in our system attributes are used to describe a user's credentials, and a party encrypting data determines a policy for who can decrypt. Thus, our methods are conceptually closer to traditional access control methods such as role-based access control (RBAC). In addition, we provide an implementation of our system and give performance measurements.Keywords
This publication has 13 references indexed in Scilit:
- Multi-authority Attribute Based EncryptionPublished by Springer Nature ,2007
- Attribute-based encryption for fine-grained access control of encrypted dataPublished by Association for Computing Machinery (ACM) ,2006
- Methods and limitations of security policy reconciliationACM Transactions on Information and System Security, 2006
- Access Control Using Pairing Based CryptographyLecture Notes in Computer Science, 2003
- An Identity Based Encryption Scheme Based on Quadratic ResiduesLecture Notes in Computer Science, 2001
- Access control mechanisms for inter-organizational workflowPublished by Association for Computing Machinery (ACM) ,2001
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Secret sharing scheme realizing general access structureElectronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- How to share a secretCommunications of the ACM, 1979