TY - GEN
T1 - Attribute-sets
T2 - 14th European Symposium on Research in Computer Security, ESORICS 2009
AU - Bobba, Rakesh
AU - Khurana, Himanshu
AU - Prabhakaran, Manoj
PY - 2009
Y1 - 2009
N2 - In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new paradigm where such policies are specified and cryptographically enforced in the encryption algorithm itself. Ciphertext-Policy ABE (CP-ABE) is a form of ABE where policies are associated with encrypted data and attributes are associated with keys. In this work we focus on improving the flexibility of representing user attributes in keys. Specifically, we propose Ciphertext Policy Attribute Set Based Encryption (CP-ASBE) - a new form of CP-ABE - which, unlike existing CP-ABE schemes that represent user attributes as a monolithic set in keys, organizes user attributes into a recursive set based structure and allows users to impose dynamic constraints on how those attributes may be combined to satisfy a policy. We show that the proposed scheme is more versatile and supports many practical scenarios more naturally and efficiently. We provide a prototype implementation of our scheme and evaluate its performance overhead.
AB - In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new paradigm where such policies are specified and cryptographically enforced in the encryption algorithm itself. Ciphertext-Policy ABE (CP-ABE) is a form of ABE where policies are associated with encrypted data and attributes are associated with keys. In this work we focus on improving the flexibility of representing user attributes in keys. Specifically, we propose Ciphertext Policy Attribute Set Based Encryption (CP-ASBE) - a new form of CP-ABE - which, unlike existing CP-ABE schemes that represent user attributes as a monolithic set in keys, organizes user attributes into a recursive set based structure and allows users to impose dynamic constraints on how those attributes may be combined to satisfy a policy. We show that the proposed scheme is more versatile and supports many practical scenarios more naturally and efficiently. We provide a prototype implementation of our scheme and evaluate its performance overhead.
UR - http://www.scopus.com/inward/record.url?scp=70350357342&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350357342&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04444-1_36
DO - 10.1007/978-3-642-04444-1_36
M3 - Conference contribution
AN - SCOPUS:70350357342
SN - 3642044433
SN - 9783642044434
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 587
EP - 604
BT - Computer Security - ESORICS 2009 - 14th European Symposium on Research in Computer Security, Proceedings
Y2 - 21 September 2009 through 23 September 2009
ER -