White-box traceable ciphertext-policy attribute-based encryption supporting any monotone access structures

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

200 Scopus Citations
View graph of relations


  • Zhen Liu
  • Zhenfu Cao
  • Duncan S. Wong

Related Research Unit(s)


Original languageEnglish
Article number6327660
Pages (from-to)76-88
Journal / PublicationIEEE Transactions on Information Forensics and Security
Issue number1
Online published9 Oct 2012
Publication statusPublished - Jan 2013


In a ciphertext-policy attribute-based encryption (CP-ABE) system, decryption keys are defined over attributes shared by multiple users. Given a decryption key, it may not be always possible to trace to the original key owner. As a decryption privilege could be possessed by multiple users who own the same set of attributes, malicious users might be tempted to leak their decryption privileges to some third parties, for financial gain as an example, without the risk of being caught. This problem severely limits the applications of CP-ABE. Several traceable CP-ABE (T-CP-ABE) systems have been proposed to address this problem, but the expressiveness of policies in those systems is limited where only and gate with wildcard is currently supported. In this paper we propose a new T-CP-ABE system that supports policies expressed in any monotone access structures. Also, the proposed system is as efficient and secure as one of the best (non-traceable) CP-ABE systems currently available, that is, this work adds traceability to an existing expressive, efficient, and secure CP-ABE scheme without weakening its security or setting any particular trade-off on its performance. © 2005-2012 IEEE.

Research Area(s)

  • Attribute-based encryption, ciphertext-policy, traceability

Citation Format(s)