基于理想格的鲁棒门限代理重加密方案

doi:10.3969/j.issn.0372-2112.2020.09.017

电子学报 ›› 2020, Vol. 48 ›› Issue (9): 1786-1794.DOI: 10.3969/j.issn.0372-2112.2020.09.017

基于理想格的鲁棒门限代理重加密方案

吴立强, 韩益亮, 杨晓元, 张敏情, 杨凯

武警工程大学武警部队网络与信息安全保密重点实验室, 陕西西安 710086

收稿日期:2019-09-27 修回日期:2019-12-03 出版日期:2020-09-25
- 通讯作者:
- 韩益亮
- 作者简介:
- 吴立强 男,1986年7月出生于陕西蓝田.现为武警工程大学密码工程学院讲师.主要研究方向为基于格的密码学和可证明安全理论.E-mail:latticewj@163.com
  杨晓元 男,1959年11月生于湖南湘潭,教授、博士生导师,主要研究领域为网络安全与密码学.E-mail:yxyangyxyang@163.com
  张敏情 女,1967年3月出生于陕西西安,教授、博士生导师,主要研究领域为信息隐藏、密码学.E-mail:api_zmq@126.com
  杨凯男,1983年10月出生于山东莱芜,讲师,博士,主要研究方向为网络安全.E-mail:sydeny-001@163.com
- 基金资助:
- 国家自然科学基金 (No.U1636114，No.61572521，No.61772550）; 国家社会科学基金项目 (No.18XXW015）; 武警工程大学创新团队科学基金资助 (No.KYTD201805）; 陕西省自然科学基金 (No.2018JM6078）

Robust Threshold Proxy Re-encryption Scheme from Ideal Lattices

WU Li-qiang, HAN Yi-liang, YANG Xiao-yuan, ZHANG Min-qing, YANG Kai

Key Laboratory of Network and Information Security, Engineering University of Chinese Armed Police Force, Xi'an, Shaanxi 710086, China

Received:2019-09-27 Revised:2019-12-03 Online:2020-09-25 Published:2020-09-25
- Corresponding author:
- HAN Yi-liang
- Supported by:
- National Natural Science Foundation of China (No.U1636114, No.61572521, No.61772550); The National Social Science Fund of China (No.18XXW015); Innovation Team Science Fund of Engineering University of PAP (No.KYTD201805); Natural Science Foundation of Shaanxi Province, China (No.2018JM6078)

摘要/Abstract

摘要： 代理重加密能够实现解密权限的转换，而鲁棒门限代理重加密（Threshold Proxy Re-Encryption，TPRE）不仅支持安全灵活的转化控制，而且支持转化密文的合法性验证.本文利用理想格上工具构造了一种TPRE方案，采用Shamir秘密共享实现门限控制，采用格上同态签名技术实现鲁棒性，可完全抗量子攻击.新方案与标准格上方案相比，密文尺寸小、密钥份额短、计算速度快；基于PRE和TPRE安全模型的差异，证明对TPRE的攻击多项式时间内可转化为对基础PRE方案的攻击，安全性可规约为R-LWE（Learning With Errors over Ring）困难假设；新方案适用于在去中心化环境中实现密文访问控制，可用于基于区块链网络的文件共享和多域网络快速互联等场景.

关键词: 代理重加密, 理想格, 鲁棒性, 同态签名, 访问控制, 量子攻击

Abstract: Proxy re-encryption can achieve decryption permission conversion, while robust threshold proxy re-encryption (TPRE) supports not only secure and flexible conversion control, but also the validity verification of converted ciphertext. An ideal lattices based TPRE was proposed achieving threshold control by Shamir secret sharing and robustness by homomorphic signature technique, which could resist to quantum analysis completely. The new scheme enjoys small ciphertext size, short key share and high calculation speed compared with the similar schemes from standard lattices. Based on the differences between PRE and TPRE security models, attacks on our TPRE can be transformed into corresponding attacks on potential PRE scheme in polynomial time, therefore its security can be reduced to R-LWE (Learning With Errors over Ring) difficult assumption. It provides encryption and cryptographic access control in a decentralized environment, and widely used in scenarios such as file sharing based on blockchain networks and rapid interconnection of multi-domain networks.

Key words: proxy re-encryption, ideal lattices, robustness, homomorphic signature, access control, quantum attack

中图分类号:

TP309

吴立强, 韩益亮, 杨晓元, 等. 基于理想格的鲁棒门限代理重加密方案[J]. 电子学报, 2020, 48(9): 1786-1794.

WU Li-qiang, HAN Yi-liang, YANG Xiao-yuan, et al. Robust Threshold Proxy Re-encryption Scheme from Ideal Lattices[J]. Acta Electronica Sinica, 2020, 48(9): 1786-1794.

参考文献

[1] M Blaze,G Bleumer,M Strauss.Divertible protocols and atomic proxy cryptography[A].International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,1998.127-144.
[2] G Ateniese,K Fu,M Green,et al.Improved proxy reencryption schemes with applications to secure distributed storage[J].ACM Transactions on Information and System Security (TISSEC),2006,9(1):1-30.
[3] Xagawa K.Cryptography with Lattices[D].Tokyo:Tokyo Institute of Technology,2010.
[4] Aono Y,Boyen X,Wang L.Key-private proxy re-encryption under LWE[A].International Conference on Cryptology[C].Berlin:Springer,2013.1-18.
[5] Singh K,Rangan C P,et al.Cryptanalysis of unidirectional proxy re-encryption scheme[A].Information and Communication Technology-EurAsia Conference[C].Berlin:Springer,2014.564-575.
[6] Kirshanova,E.Proxy Re-encryption from lattices[A].International Workshop on Public Key Cryptography[C].Berlin:Springer,2014.77-94.
[7] Jiang M M,Hu Y P,et al.Lattice based multi-use unidirectional proxy re-encryption[J].Security & Communication Networks,2016,8(18):3796-3803.
[8] Fan X,Liu F H.Various Proxy Re-encryption Schemes from Lattices[EB/OL].https://eprint.iacr.org/2016/278.pdf,2017-05-11/2019-09-04.
[9] Polyakov Y,Rohloff K,et al.Fast proxy re-encryption for publish/subscribe systems[J].ACM Transactions on Privacy and Security,2017,20(4):1-31.
[10] Nu†ez D,Agudo I,Lopez J.NTRUReEncrypt:An efficient proxy re-encryption scheme based on NTRU[A].Proceedings of the 10th ACM Symposium on Information,Computer and Communications Security[C].Singapore:ACM,2015.179-189.
[11] Cohen A.What about Bob? The inadequacy of CPA security for proxy reencryption[A].IACR International Workshop on Public Key Cryptography[C].Berlin:Springer,2019.287-316.
[12] Fuchsbauer G.,Kamath C,et al.Adaptively secure proxy re-encryption[A].IACR International Workshop on Public Key Cryptography[C].Berlin:Springer,2019.317-346.
[13] 楼圣铭,曹珍富.基于身份的门限多代理者的代理重加密方案[J].黑龙江大学自然科学学报,2010,27(2):151-156.
[14] D Boneh,R Gennaro,et al.A Lattice-Based Universal Thresholdizer for Cryptographic Systems[EB/OL].https://eprint.iacr.org/2017/251.pdf,2017-03-19/2019-09-04.
[15] 李菊雁,马春光,赵乾.格上可重新拆分的门限多代理者的代理重加密方案[J].通信学报,2017,38(5):157-164. Ju-yan LI,Chun-guang MA,Qian ZHAO.Resplittable threshold multi-broker proxy re-encryption scheme from lattices[J].Journal on Communications,2017,38(5):157-164.(in Chinese)
[16] Lyubashevsky V,Peikert C,Regev O.On ideal lattices and learning with errors over rings[A].Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2010.1-23.
[17] David N.UMBRAL:A Threshold Proxy Re-Encryption Scheme[EB/OL].https://github.com/nucypher/umbral-doc/blob/master/mbral-doc.pdf,2018-05-06/2019-09-04.
[18] Boneh D,Freeman D M.Homomorphic signatures for polynomial functions[A].Annual International Conference on the Theory and Applications of Cryptographic Techniques[C].Berlin:Springer,2011.149-168.
[19] Gorbunov S,Vaikuntanathan V,et al.Leveled fully homomorphic signatures from standard lattices[A].Proceedings of the forty-seventh annual ACM symposium on Theory of computing[C].USA:ACM,2015.469-477.

基于理想格的鲁棒门限代理重加密方案

Robust Threshold Proxy Re-encryption Scheme from Ideal Lattices

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	赵开强, 康萍, 刘彬, 郭真, 冯朝胜, 卿昱. 支持云代理重加密的CP-ABE方案[J]. 电子学报, 2023, 51(3): 728-735.
[2]	郭庆, 田有亮, 万良. 基于代理重加密的区块链数据受控共享方案[J]. 电子学报, 2023, 51(2): 477-488.
[3]	林志, 林敏, 黄清泉, 赵柏, 顾晨伟, 许拔. 能效最大化准则下的星地融合网络的安全波束成形算法[J]. 电子学报, 2022, 50(1): 124-134.
[4]	刘镇, 吴立强, 韩益亮, 杨晓元, 柳曙光. 一种基于环上LWE的广义签密方案[J]. 电子学报, 2021, 49(7): 1314-1322.
[5]	孟祥新, 柳桃荣, 笪敏, 刘泽鑫. 一种高精度的毫米波稀疏平面阵列频域类成像算法[J]. 电子学报, 2020, 48(8): 1479-1485.
[6]	井美, 惠小静, 王蓉. 基于相似度的直觉模糊推理反向三I算法的鲁棒性[J]. 电子学报, 2020, 48(2): 265-271.
[7]	曾伟辉, 李淼, 李增, 熊焰. 基于高阶残差和参数共享反馈卷积神经网络的农作物病害识别[J]. 电子学报, 2019, 47(9): 1979-1986.
[8]	王春东, 杨蕾, 万福金, 刘哲理, 朱立坤. 数据库水印模型及其算法综述[J]. 电子学报, 2019, 47(4): 946-954.
[9]	惠小静, 井美, 王蓉. 基于直觉模糊推理(1,2,2)-a型泛三I算法的鲁棒性[J]. 电子学报, 2019, 47(2): 410-416.
[10]	黄翔东, 杨琳, 杨孟凯, 黄光明. 抗噪鲁棒性可分级的稀疏阵列频率和到达角估计[J]. 电子学报, 2019, 47(1): 122-128.
[11]	罗恩韬, 陈淑红, 王文博, 张少波, PINIAL Khan-butt. 移动社交网络多密钥混淆的交友隐私保护方案研究[J]. 电子学报, 2018, 46(9): 2123-2130.
[12]	谢显中, 陈九九, 扶渝茜. 全双工信息与能量同传系统的鲁棒性预编码及高能效时隙分配方案[J]. 电子学报, 2018, 46(5): 1213-1221.
[13]	王尔申, 王玉伟, 庞涛, 曲萍萍, 姜毅. 基于边攻击成本的复杂网络鲁棒性研究[J]. 电子学报, 2018, 46(5): 1166-1172.
[14]	王于丁, 杨家海. DACPCC:一种包含访问权限的云计算数据访问控制方案[J]. 电子学报, 2018, 46(1): 236-244.
[15]	于冲, 赵海, 司帅宗, 彭海霞. 车载网运动模型的复杂网络解析方法[J]. 电子学报, 2017, 45(6): 1449-1455.