ACM Home Page
Please provide us with feedback. Feedback
Attribute-based encryption with non-monotonic access structures
Full text PdfPdf (217 KB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 14th ACM conference on Computer and communications security table of contents
Alexandria, Virginia, USA
SESSION: Cryptography table of contents
Pages: 195 - 203  
Year of Publication: 2007
ISBN:978-1-59593-703-2
Authors
Rafail Ostrovsky  UCLA, Los Angeles, CA
Amit Sahai  UCLA, Los Angeles, CA
Brent Waters  SRI International, Menlo Park, CA
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 168,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1315245.1315270
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Anton and C. Rorres. Elementary Linear Algebra, 9th Edition. 2005.
 
2
A. Beimel. Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Israel Institute of Technology, Technion, Haifa, Israel, 1996.
 
3
 
4
 
5
G. R. Blakley. Safeguarding cryptographic keys. In National Computer Conference, pages 313--317. American Federation of Information Processing Societies Proceedings, 1979.
 
6
D. Boneh and X. Boyen. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles. In Advances in Cryptology - Eurocrypt, volume 3027 of LNCS, pages 223--238. Springer, 2004.
 
7
 
8
D. Boneh, C. Gentry, and B. Waters. Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In Advances in Cryptology - CRYPTO, volume 3621 of LNCS, pages 258--275. Springer, 2005.
9
 
10
E. F. Brickell. Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing, 6:105--113, 1989.
 
11
R. Canetti, S. Halevi, and J. Katz. A Forward-Secure Public-Key Encryption Scheme. In Advances in Cryptology - Eurocrypt, volume 2656 of LNCS. Springer, 2003.
 
12
R. Canetti, S. Halevi, and J. Katz. Chosen Ciphertext Security from Identity Based Encryption. In Advances in Cryptology - Eurocrypt, volume 3027 of LNCS, pages 207--222. Springer, 2004.
 
13
M. Chase. Multi-authority attribute-based encryption. In The Fourth Theory of Cryptography Conference (TCC 2007), 2007.
14
 
15
16
 
17
M. Ito, A. Saito, and T. Nishizeki. Secret Sharing Scheme Realizing General Access Structure. In IEEE Globecom. IEEE, 1987.
 
18
19
 
20
V. V. Prasolov. Problems and Theorems in Linear Algebra. American Mathematical Society, 1994.
 
21
A. Sahai and B. Waters. Fuzzy Identity Based Encryption. In Advances in Cryptology - Eurocrypt, volume 3494 of LNCS, pages 457--473. Springer, 2005.
22
 
23
 
24
N. Smart. Access control using pairing based cryptography. In CT-RSA, pages 111--121, 2003.


Collaborative Colleagues:
Rafail Ostrovsky: colleagues
Amit Sahai: colleagues
Brent Waters: colleagues