首页 | 本学科首页   官方微博 | 高级检索  
     


Privacy-preserving attribute-based encryption scheme on ideal lattices
Authors:Xixi YAN  Yuan LIU  Zichen LI  Yongli TANG  Qing YE
Affiliation: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
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.
Keywords:attribute based encryption  ideal lattices  privacy-preserving  R-LWE  access tree  
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号