Netinfo Security ›› 2014, Vol. 15 ›› Issue (10): 59-63.doi: 10.3969/j.issn.1671-1122.2014.10.011

• 技术研究 • Previous Articles    

Anonymous Attribute-based Encryption Supporting Attribute Matching-Test

Ke LIAN, Ze-mao ZHAO, Yu-ju HE   

  1. College of Communication Engineering, Hangzhou Dianzi University, Hangzhou Zhejiang 310018, China
  • Received:2014-08-25 Online:2014-10-01 Published:2015-08-17

Abstract:

Attribute-based encryption (ABE) scheme takes attributes as the public key and associates the ciphertext and user’s secret key with attributes, so that it can support expressive access control policies. This dramatically reduces the cost of network bandwidth and sending node operation in fine-grained access control of data sharing. Anonymous ABE, which is a relevant notion to ABE, further hides the receivers’ attribute information in ciphertexts because many attributes are sensitive and related to the identity of eligible users. In the anonymous ABE scheme, a user repeats decryption attempts as he doesn’t know whether the attributes match the policy, the computation overhead of each decryption is high and unnecessary.This paper proposes a new anonymous attribute-based encryption scheme which supports attribute matching-test, users can run the attribute matching-test algorithm to judge whether the set of attributes meet the ciphertext access policy without decrypting ciphertext.In this construction, the computation cost of such a test is much less than one decryption attempt.The proposed construction is proven to be secure on decisional bilinear Diffie-Hellman assumption.In addition,the result indicates that the proposed construction can significantly improve the efficiency of decryption.

Key words: attribute-based encryption, hidden access policy, privacy, anonymous

CLC Number: