ACM Home Page
Please provide us with feedback. Feedback
Secure attribute-based systems
Full text PdfPdf (1.13 MB)
Source Conference on Computer and Communications Security archive
Proceedings of the 13th ACM conference on Computer and communications security table of contents
Alexandria, Virginia, USA
SESSION: Data protection table of contents
Pages: 99 - 112  
Year of Publication: 2006
ISBN:1-59593-518-5
Authors
Matthew Pirretti  Pennsylvania State University, University Park, PA
Patrick Traynor  Pennsylvania State University, University Park, PA
Patrick McDaniel  Pennsylvania State University, University Park, PA
Brent Waters  SRI International, Menlo Park, CA
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 178,   Citation Count: 0
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/1180405.1180419
What is a DOI?

ABSTRACT

Attributes define, classify, or annotate the datum to which they are assigned. However, traditional attribute architectures and cryptosystems are ill-equipped to provide security in the face of diverse access requirements and environments. In this paper, we introduce a novel secure information management architecture based on emerging attribute-based encryption (ABE) primitives. A policy system that meets the needs of complex policies is defined and illustrated. Based on the needs of those policies, we propose cryptographic optimizations that vastly improve enforcement efficiency. We further explore the use of such policies in two example applications: a HIPAA compliant distributed file system and a social network. A performance analysis of our ABE system and example applications demonstrates the ability to reduce cryptographic costs by as much as 98% over previously proposed constructions. Through this, we demonstrate that our attribute system is an efficient solution for securely managing information in large, loosely-coupled, distributed systems.


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
Friendster. http://www.friendster.com, 2006.
 
2
The human genome project. http://www.ornl.gov/sci/techresources/Human_Genome/home.shtml, 2006.
 
3
The OpenSSL project. http://www.openssl.org, 2006.
4
 
5
 
6
M. Bowman, C. Dharap, M. Baruah, B. Camargo, and S. Potti. A file system for information management. In Proceedings of the ISMM International Conference on Intelligent Information Management Systems, March 1994.
 
7
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas. Multicast security: A taxonomy and some efficient constructions. In Proceedings of IEEE INFOCOM'99, 1999.
8
 
9
10
11
 
12
C. Ellison and B. Schneier. Ten Risks of PKI: What You're Not Being Told About Public i Key Infrastructure. Computer Security Journal, 16(1):1--7, 2000.
13
 
14
 
15
 
16
D. R. Hardy and M. F. Schwartz. Essence: A resource discovery system based on semantic file indexing. In Proceedings of the USENIX Winter Conference, pages 361--374, Berkeley, CA, January 1993. USENIX Association.
 
17
 
18
B. Lampson. Protection. In Proceedings of the 5th Annual Princeton Conference on Information Sciences and Systems, pages 437--443, Princeton University, 1971.
 
19
B. Lynn. PBC library. http://rooster.stanford.edu/ben/pbc/, 2006.
 
20
P. McDaniel, A. Prakash, and P. Honeyman. A flexible framework for secure group communication. In USENIX Security Symposium, pages 99--114, 1999.
 
21
 
22
A. J. Menezes, T. Okamoto, and S. A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions On Information Theory, 39(5):1639--1646, September 1993.
 
23
A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals, E84-A(5):1234--1243, 2001.
 
24
 
25
D. Nali, C. Adams, and A. Miri. Using threshold attribute-based encryption for practical biometric-based access control. 1(3):173--182, November 2005.
 
26
A. Sahai and B. Waters. Fuzzy identity based encryption. In Eurocrypt 2005, 2005.
 
27
 
28
R. S. Sandhu and P. Samarati. Access control: Principles and practice. IEEE Communications Magazine, 32(9):40--48, 1994.
29
 
30
 
31
V. Shoup. Using hash functions as a hedge against chosen ciphertext attack. In EUROCRYPT, pages 275--288, 2000.
 
32
United States Department of Health and Human Services. Health Insurance Portability and Accountability Act. http://aspe.hhs.gov/admnsimp/pl104191.htm, 1996.

CITED BY  9

Collaborative Colleagues:
Matthew Pirretti: colleagues
Patrick Traynor: colleagues
Patrick McDaniel: colleagues
Brent Waters: colleagues