Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles

Zhen Liu; Zhenfu Cao; Qiong Huang; Duncan S. Wong; Tsz Hon Yuen

doi:10.1007/978-3-642-23822-2_16

Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles

Zhen Liu
, Zhenfu Cao
, Qiong Huang
, Duncan S. Wong
, Tsz Hon Yuen

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

110 Citations (Scopus)

Abstract

Recently Lewko and Waters proposed the first fully secure multi-authority ciphertext-policy attribute-based encryption (CP-ABE) system in the random oracle model, and leave the construction of a fully secure multi-authority CP-ABE in the standard model as an open problem. Also, there is no CP-ABE system which can completely prevent individual authorities from decrypting ciphertexts. In this paper, we propose a new multi-authority CP-ABE system which addresses these two problems positively. In this new system, there are multiple Central Authorities (CAs) and Attribute Authorities (AAs), the CAs issue identity-related keys to users and are not involved in any attribute related operations, AAs issue attribute-related keys to users and each AA manages a different domain of attributes. The AAs operate independently from each other and do not need to know the existence of other AAs. Messages can be encrypted under any monotone access structure over the entire attribute universe. The system is adaptively secure in the standard model with adaptive authority corruption, and can support large attribute universe.

Original language	English
Title of host publication	Computer Security, ESORICS 2011 - 16th European Symposium on Research in Computer Security, Proceedings
Publisher	Springer-Verlag London Ltd.
Pages	278-297
Number of pages	20
ISBN (Print)	9783642238215
DOIs	https://doi.org/10.1007/978-3-642-23822-2_16
Publication status	Published - 2011
Externally published	Yes
Event	European Symposium on Research in Computer Security 2011 - Leuven, Belgium Duration: 12 Sept 2011 → 14 Sept 2011 Conference number: 16th https://link.springer.com/book/10.1007/978-3-642-23822-2

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	6879
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	European Symposium on Research in Computer Security 2011
Abbreviated title	ESORICS 2011
Country/Territory	Belgium
City	Leuven
Period	12/09/11 → 14/09/11
Internet address	https://link.springer.com/book/10.1007/978-3-642-23822-2

Keywords

Attribute based encryption
ciphertext-policy
multi-authority

Access to Document

10.1007/978-3-642-23822-2_16

Cite this

Liu, Z., Cao, Z., Huang, Q., Wong, D. S., & Yuen, T. H. (2011). Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles. In Computer Security, ESORICS 2011 - 16th European Symposium on Research in Computer Security, Proceedings (pp. 278-297). (Lecture Notes in Computer Science; Vol. 6879). Springer-Verlag London Ltd.. https://doi.org/10.1007/978-3-642-23822-2_16

@inproceedings{3de373dffaaf4bb1bb348eaad9e07631,

title = "Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles",

abstract = "Recently Lewko and Waters proposed the first fully secure multi-authority ciphertext-policy attribute-based encryption (CP-ABE) system in the random oracle model, and leave the construction of a fully secure multi-authority CP-ABE in the standard model as an open problem. Also, there is no CP-ABE system which can completely prevent individual authorities from decrypting ciphertexts. In this paper, we propose a new multi-authority CP-ABE system which addresses these two problems positively. In this new system, there are multiple Central Authorities (CAs) and Attribute Authorities (AAs), the CAs issue identity-related keys to users and are not involved in any attribute related operations, AAs issue attribute-related keys to users and each AA manages a different domain of attributes. The AAs operate independently from each other and do not need to know the existence of other AAs. Messages can be encrypted under any monotone access structure over the entire attribute universe. The system is adaptively secure in the standard model with adaptive authority corruption, and can support large attribute universe.",

keywords = "Attribute based encryption, ciphertext-policy, multi-authority",

author = "Zhen Liu and Zhenfu Cao and Qiong Huang and Wong, \{Duncan S.\} and Yuen, \{Tsz Hon\}",

year = "2011",

doi = "10.1007/978-3-642-23822-2\_16",

language = "English",

isbn = "9783642238215",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag London Ltd.",

pages = "278--297",

booktitle = "Computer Security, ESORICS 2011 - 16th European Symposium on Research in Computer Security, Proceedings",

address = "Germany",

note = "European Symposium on Research in Computer Security 2011, ESORICS 2011 ; Conference date: 12-09-2011 Through 14-09-2011",

url = "https://link.springer.com/book/10.1007/978-3-642-23822-2",

}

Liu, Z, Cao, Z, Huang, Q, Wong, DS & Yuen, TH 2011, Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles. in Computer Security, ESORICS 2011 - 16th European Symposium on Research in Computer Security, Proceedings. Lecture Notes in Computer Science, vol. 6879, Springer-Verlag London Ltd., pp. 278-297, European Symposium on Research in Computer Security 2011, Leuven, Belgium, 12/09/11. https://doi.org/10.1007/978-3-642-23822-2_16

Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles. / Liu, Zhen; Cao, Zhenfu; Huang, Qiong et al.
Computer Security, ESORICS 2011 - 16th European Symposium on Research in Computer Security, Proceedings. Springer-Verlag London Ltd., 2011. p. 278-297 (Lecture Notes in Computer Science; Vol. 6879).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles

AU - Liu, Zhen

AU - Cao, Zhenfu

AU - Huang, Qiong

AU - Wong, Duncan S.

AU - Yuen, Tsz Hon

N1 - Conference code: 16th

PY - 2011

Y1 - 2011

N2 - Recently Lewko and Waters proposed the first fully secure multi-authority ciphertext-policy attribute-based encryption (CP-ABE) system in the random oracle model, and leave the construction of a fully secure multi-authority CP-ABE in the standard model as an open problem. Also, there is no CP-ABE system which can completely prevent individual authorities from decrypting ciphertexts. In this paper, we propose a new multi-authority CP-ABE system which addresses these two problems positively. In this new system, there are multiple Central Authorities (CAs) and Attribute Authorities (AAs), the CAs issue identity-related keys to users and are not involved in any attribute related operations, AAs issue attribute-related keys to users and each AA manages a different domain of attributes. The AAs operate independently from each other and do not need to know the existence of other AAs. Messages can be encrypted under any monotone access structure over the entire attribute universe. The system is adaptively secure in the standard model with adaptive authority corruption, and can support large attribute universe.

AB - Recently Lewko and Waters proposed the first fully secure multi-authority ciphertext-policy attribute-based encryption (CP-ABE) system in the random oracle model, and leave the construction of a fully secure multi-authority CP-ABE in the standard model as an open problem. Also, there is no CP-ABE system which can completely prevent individual authorities from decrypting ciphertexts. In this paper, we propose a new multi-authority CP-ABE system which addresses these two problems positively. In this new system, there are multiple Central Authorities (CAs) and Attribute Authorities (AAs), the CAs issue identity-related keys to users and are not involved in any attribute related operations, AAs issue attribute-related keys to users and each AA manages a different domain of attributes. The AAs operate independently from each other and do not need to know the existence of other AAs. Messages can be encrypted under any monotone access structure over the entire attribute universe. The system is adaptively secure in the standard model with adaptive authority corruption, and can support large attribute universe.

KW - Attribute based encryption

KW - ciphertext-policy

KW - multi-authority

UR - https://www.scopus.com/pages/publications/80052991483

U2 - 10.1007/978-3-642-23822-2_16

DO - 10.1007/978-3-642-23822-2_16

M3 - Conference Paper

AN - SCOPUS:80052991483

SN - 9783642238215

T3 - Lecture Notes in Computer Science

SP - 278

EP - 297

BT - Computer Security, ESORICS 2011 - 16th European Symposium on Research in Computer Security, Proceedings

PB - Springer-Verlag London Ltd.

T2 - European Symposium on Research in Computer Security 2011

Y2 - 12 September 2011 through 14 September 2011

ER -

Fully secure multi-authority ciphertext-policy attribute-based encryption without random oracles

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this