通信学报 ›› 2018, Vol. 39 ›› Issue (3): 128-135.doi: 10.11959/j.issn.1000-436x.2018048

• 论文Ⅱ:学术论文 • 上一篇    下一篇

理想格上支持隐私保护的属性基加密方案

闫玺玺1,刘媛1,李子臣2,汤永利1,叶青1   

  1. 1 河南理工大学计算机科学与技术学院,河南 焦作454003
    2 北京印刷学院信息工程学院,北京 102600
  • 修回日期:2017-12-13 出版日期:2018-03-01 发布日期:2018-04-02
  • 作者简介:闫玺玺(1985-),女,河南灵宝人,博士,河南理工大学副教授、硕士生导师,主要研究方向为网络与信息安全、数字版权管理、数字内容安全和密码学。|刘媛(1989-),女,河南濮阳人,河南理工大学硕士生,主要研究方向为密码学、网络与信息安全。|李子臣(1965-),男,河南温县人,北京印刷学院教授、博士生导师,主要研究方向为信息安全、电子商务和密码学。|汤永利(1972-),男,河南焦作人,博士后,河南理工大学教授、硕士生导师,主要研究方向为密码学算法检测、网络与信息安全。|叶青(1981-),女,辽宁营口人,博士,河南理工大学讲师、硕士生导师,主要研究方向为密码学和数字签名。
  • 基金资助:
    国家自然科学基金资助项目(61300216);国家密码管理局“十三五”国家密码发展基金资助项目(MMJJ20170122);河南省教育厅科研基金资助项目(16A520013);河南理工大学博士基金资助项目(B2014-044)

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)

摘要:

理想格上的加密方案具有密钥尺寸小、加密效率高的优势,利用理想格环上带误差学习(R-LWE,ring learning with error)问题,构造一种可以保护用户属性隐私的属性基加密方案,支持灵活的访问策略,提供用户隐私保护,并且提高方案效率,缩短密钥尺寸。该方案通过采用半策略隐藏方式,保护用户的隐私,从而避免用户的敏感属性值泄露给其他任何第三方。另外,将扩展的Shamir门限秘密共享技术应用于构造方案的访问结构,从而实现用户属性的“与”“或”“门限”这3 种操作,具有更高的灵活性。经安全性分析证明,该方案在标准模型下满足自适应选择明文攻击安全。通过与其他方案的对比,该方案系统公钥、系统私钥、用户私钥长度以及密文长度都有所优化,在实际应用中更加有效。

关键词: 属性基加密, 理想格, 隐私保护, 环上带误差学习, 访问树

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

中图分类号: 

No Suggested Reading articles found!