Journal on Communications ›› 2018, Vol. 39 ›› Issue (3): 128-135.doi: 10.11959/j.issn.1000-436x.2018048

• Papers • Previous Articles     Next Articles

Privacy-preserving attribute-based encryption scheme on ideal lattices

Xixi YAN1,Yuan LIU1,Zichen LI2,Yongli TANG1,Qing YE1   

  1. 1 School of Computer Science and Technology,Henan Polytechnic University,Jiaozuo 454003,China
    2 School of Information Engineering,Beijing Institute of Graphic Communication,Beijing 102600,China
  • Revised:2017-12-13 Online:2018-03-01 Published:2018-04-02
  • Supported by:
    The National Natural Science Foundation of China(61300216);The Scientific Research Project of Henan Province(16A520013);Research Fund for the Doctoral Program of Henan Polytechnic University(B2014-044)

Abstract:

Based on the small key size and high encryption efficiency on ideal lattices,a privacy-preserving attribute-based encryption scheme on ideal lattices was proposed,which could support flexible access policies and privacy protection for the users.In the scheme,a semi-hidden policy was introduced to protect the users’ privacy.Thus,the sensitive values of user’s attributes are hidden to prevent from revealing to any third parties.In addition,the extended Shamir secret-sharing schemes was used to construct the access tree structure which can support “and” “or” and “threshold” operations of attributes with a high flexibility.Besides,the scheme was proved to be secure against chosen plaintext attack under the standard mode.Compared to the existing related schemes,the scheme can yield significant performance benefits,especially the size of system public/secret keys,users’ secret key and ciphertext.It is more effective in the large scale distributed environment.

Key words: attribute based encryption, ideal lattices, privacy-preserving, R-LWE, access tree

CLC Number: 

No Suggested Reading articles found!