Large Universe Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability

  • Jianting Ning
  • Zhenfu Cao
  • Xiaolei Dong
  • Lifei Wei
  • Xiaodong Lin
Conference paper

DOI: 10.1007/978-3-319-11212-1_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8713)
Cite this paper as:
Ning J., Cao Z., Dong X., Wei L., Lin X. (2014) Large Universe Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability. In: Kutyłowski M., Vaidya J. (eds) Computer Security - ESORICS 2014. ESORICS 2014. Lecture Notes in Computer Science, vol 8713. Springer, Cham

Abstract

A Ciphertext-Policy Attribute-Based Encryption (CP-ABE) system extracts the decryption keys over attributes shared by multiple users. It brings plenty of advantages in ABE applications. CP-ABE enables fine-grained access control to the encrypted data for commercial applications. There has been significant progress in CP-ABE over the recent years because of two properties called traceability and large universe, greatly enriching the commercial applications of CP-ABE. Traceability is the ability of ABE to track the malicious users or traitors who intentionally leak the partial or modified decryption keys to others for profits. Nevertheless, due to the nature of CP-ABE, it is difficult to identify the original key owner from an exposed key since the decryption privilege is shared by multiple users who have the same attributes. On the other hand, the property of large universe in ABE proposed by Lewko and Waters enlarges the practical applications by supporting flexible number of attributes. Several systems have been proposed to obtain either of the above properties. However, none of them achieve the two properties simultaneously in practice, which limits the commercial applications of CP-ABE to a certain extent. In this paper, we propose a practical large universe CP-ABE system supporting white-box traceability, which is suitable for commercial applications. Compared to existing systems, our new system has three advantages: (1) The number of attributes is not polynomially bounded; (2) Malicious users who leak their decryption keys could be traced; and, (3) The storage overhead for traitor tracing is constant. We also prove the selective security of our new system in the standard model under “q-type” assumption.

Keywords

Attribute-Based Encryption Ciphertext-Policy Large Universe White-box Traceablity Commercial Applications 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jianting Ning
    • 1
  • Zhenfu Cao
    • 1
  • Xiaolei Dong
    • 1
  • Lifei Wei
    • 2
  • Xiaodong Lin
    • 3
  1. 1.Department of Computer Science and EngineeringShanghai Jiao Tong UniversityShanghaiChina
  2. 2.College of Information TechnologyShanghai Ocean UniversityShanghaiChina
  3. 3.Faculty of Business and Information TechnologyUniversity of Ontario Institute of TechnologyOshawaCanada

Personalised recommendations