Ciphertext-policy attribute-based encryption

被引：3018

作者：

Bethencourt, John ^{[1
]}

Sahai, Amit ^{[2
]}

Waters, Brent ^{[3
]}

机构：

[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA

[2] Univ Calif Los Angeles, Los Angeles, CA 90095 USA

[3] SRI Int, Menlo Pk, CA USA

来源：

2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS | 2007年

基金：

中国国家自然科学基金;

关键词：

D O I：

10.1109/sp.2007.11

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：321 / +

页数：3

共 30 条

[21]

Lynn B., The Pairing -Based Cryptography Library

[22] Methods and limitations of security policy reconciliation [J].

McDaniel, P ;

Prakash, A .

2002 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2002, :73-87

[23]

Pirretti M., 2006, ACM C COMP COMM SEC

[24] Fuzzy identity-based encryption [J].

Sahai, A ;

Waters, B .

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2005,PROCEEDINGS, 2005, 3494 :457-473

[25] FAST PROBABILISTIC ALGORITHMS FOR VERIFICATION OF POLYNOMIAL IDENTITIES [J].

SCHWARTZ, JT .

JOURNAL OF THE ACM, 1980, 27 (04) :701-717

[26] HOW TO SHARE A SECRET [J].

SHAMIR, A .

COMMUNICATIONS OF THE ACM, 1979, 22 (11) :612-613

[27]

Shamir A., 1984, LNCS, V196, P37

[28]

Smart NP, 2003, LECT NOTES COMPUT SC, V2612, P111

[29] A unified scheme for resource protection in automated trust negotiation [J].

Yu, T ;

Winslett, M .

2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, :110-122

[30]

Zippel R., 1979, LECT NOTES COMPUTER, V72, P216, DOI DOI 10.1007/3-540-09519-5_73

← 1 2 3 →