Journal on Communications ›› 2014, Vol. 35 ›› Issue (Z2): 26-32.doi: 10.3969/j.issn.1000-436x.2014.z2.005

• Papers • Previous Articles     Next Articles

Adaptively secure key-policy ABE scheme with fast decryption

Qi LI1,2,Jian-feng MA1,2,3,Jin-bo XIONG4,Xi-meng LIU2,5   

  1. 1 School of Computer Science and Technology,Xidian University,Xi’an 710071,China
    2 Shaanxi Key Laboratory of Network and System Security,Xidian University,Xi’an 710071,China
    3 Science and Technology on Communication Information Security Control Laboratory,Jiaxing 314033,China
    4 Faculty of Software,Fujian Normal University,Fuzhou 350108,China
    5 School of Telecommunication Engineering,Xidian University,Xi’an 710071,China
  • Online:2014-11-25 Published:2017-06-19
  • Supported by:
    The Key Program of NSFC-Guangdong Union Foundation;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Fundamental Research Funds for the Central Universities

Abstract:

In the existing adaptively secure ABE (attribute-based encryption) schemes,the decryption cost goes linearly with the number of attributes that are used in decryption.An adaptively secure key-policy ABE (FKP-ABE) scheme with fast decryption is proposed,where constant size of computation overhead is implemented in decryption.This scheme is constructed on composite order bilinear groups and supports any monotonic access structure that can be expressed by LSSS (linear secret sharing schemes).The proposed scheme is proved to be adaptively secure in the standard model.

Key words: attribute-based encryption, key-policy, adaptive security, fast decryption, composite order, standard model

No Suggested Reading articles found!