Journal on Communications ›› 2018, Vol. 39 ›› Issue (12): 113-133.doi: 10.11959/j.issn.1000-436x.2018279

• Papers • Previous Articles     Next Articles

k-times attribute-based authentication scheme using direct anonymous attestation

Xin LIU1,2(),Qiuliang XU3,Bin ZHANG1,2,Bo ZHANG4   

  1. 1 School of Information Engineering, Shandong Youth University of Political Science, Ji'nan 250013, China
    2 Key Laboratory of Information Security and Intelligent Control in Universities of Shandong (Shandong Youth University of Political Science), Ji'nan 250103, China
    3 Software College, Shandong University, Ji'nan 250101, China
    4 School of Information Science and Engineering, University of Ji'nan, Ji'nan 250022, China
  • Revised:2018-09-10 Online:2018-12-01 Published:2019-01-21
  • Supported by:
    The National Natural Science Foundation of China(No.61173139);Shandong Provincial Natural Science Foundation(No.ZR2015FL023);Shandong Provincial Natural Science Foundation(No.ZR2014FL011);The Project of Shandong Province Higher Educational Science and Technology Program(No.ZR2015FL022);Shandong Provincial Natural Science Foundation(No.J17KA081);Shandong Provincial Natural Science Foundation(No.J15LN16);Shandong Provincial Natural Science Foundation(No.J13LN23);The Doctoral Research Start-up Funding Project of Shandong Youth University of Political Science(No.14A007)

Abstract:

s: At present, the main drawbacks of existing k-times attribute-based authentication (abbreviated to k-TABA) schemes and related attribute-based authentication schemes are that the computation cost of the authentication process depends on the size of the access formula and none of these schemes considers the problems of member revocation and attribute update. A new k-TABA scheme was constructed based on the building blocks of direct anonymous attestation, set membership proof and ciphertext-policy attribute-based encryption. Moreover, in order to reduce user's calculation as much as possible, the underlying attribute-based encryption scheme was modified, and then the main decryption operations were outsourced by using the key binding technique of Green et al. The new scheme can be deployed on a trusted platform and support expressive authentication policies. In addition, it also satisfies several ideal properties, such as registration process verifiability, member revocation, attribute update, and so on. The significant performance advantage of the new scheme is that the computation overhead of the user in the authentication phase is constant.

Key words: attribute-based authentication, direct anonymous attestation, ciphertext-policy attribute-based encryption, linear secret sharing, outsourced decryption

CLC Number: 

No Suggested Reading articles found!