武警工程大学武警部队网络与信息安全保密重点实验室,陕西西安 710086
[ "刘 镇 男,1985年6月生于湖南省衡南县.现为武警工程大学讲师,主要研究方向为公钥密码算法、可证明安全等.E‑mail: lliuzheng@163.com" ]
[ "吴立强 男,1986年7月出生于陕西省蓝田县.现为武警工程大学密码工程学院讲师,主要研究方向为基于格的密码学和可证明安全理论.E‑mail:latticewj@163.com" ]
[ "韩益亮(通信作者) 男,1977年10月出生于甘肃省会宁县.教授、博士生导师,主要研究方向为信息安全与密码学.E‑mail:hanyil@163.com." ]
[ "杨晓元 男,1959年11月生于湖南省湘潭市.教授、博士生导师,主要研究领域为网络安全与密码学.E‑mail:yxyangyxyang@163.com" ]
[ "柳曙光 男,1976年生于山东省栖霞市.副教授,主要研究领域为计算机应用、信息安全.E‑mail:18292011695@139.com" ]
收稿:2019-09-27,
修回:2020-08-12,
纸质出版:2021-07-25
移动端阅览
刘镇,吴立强,韩益亮等.一种基于环上LWE的广义签密方案[J].电子学报,2021,49(07):1314-1322.
LIU Zhen,WU Li-qiang,HAN Yi-liang,et al.A Generalized Signcryption Scheme Based on LWE over Rings[J].ACTA ELECTRONICA SINICA,2021,49(07):1314-1322.
刘镇,吴立强,韩益亮等.一种基于环上LWE的广义签密方案[J].电子学报,2021,49(07):1314-1322. DOI: 10.12263/DZXB.20190978.
LIU Zhen,WU Li-qiang,HAN Yi-liang,et al.A Generalized Signcryption Scheme Based on LWE over Rings[J].ACTA ELECTRONICA SINICA,2021,49(07):1314-1322. DOI: 10.12263/DZXB.20190978.
广义签密可以灵活地工作在签密、签名和加密三种模式,具有很强的实用性.本文结合基于格的签名方案和密钥交换协议,构造了一个无陷门的广义签密方案.方案构造中引入了区分函数,根据输入的发送方与接收方密钥情况来自动识别加密、签名和签密三种模式,保障了算法在这三种工作模式下的优美对称性.基于环上判定性LWE问题,并借鉴FO13的方法,证明了该方案满足自适用抗选择密文攻击不可区分性安全性(IND-CCA2)和自适用抗选择消息攻击强不可伪造性安全性(SUF-CMA).该方案是基于Fiat-Shamir的中止(abort)框架,没有用到复杂的原像抽样和陷门生成算法,具有较高的计算效率.
Generalized signcryption can run flexibly in three modes: signcryption
signature and encryption
and has strong practicability.This paper combines lattice‑based signature scheme and key exchange protocol to construct a trapdoor-free generalized signcryption scheme.In the construction
a distinguishing function is introduced
which automatically identifies the three modes of encryption
signature and signcryption according to the key conditions of the sender and the receiver. This ensures the excellent symmetry of the algorithm in these three modes.Finally
based on the deterministic learning with errors (LWE) problem on the ring
itused the method of FO13 toprove that the scheme satisfies the indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) security and the strong unforgeability against choosing message attack (SUF-CMA) security.It is based on Fiat-Shamir with abort framework which does not use complex preimage sample algorithmand trapdoor generation algorithm
so it has high computational efficiency.
Zheng Y . Digital signcryption or how to achieve cost(signature & encryption) << cost(signature) + cost(encryption) [A]. Annual International Cryptology Conference [C]. Berlin, Heidelberg,Germany : Springer , 1997 . 165 - 179 .
Han Y , Yang X , Wei P , et al . ECGSC: elliptic curve based generalized signcryption [A]. International Conference on Ubiquitous Intelligence and Computing [C]. Berlin, Heidelberg,Germany : Springer , 2006 . 956 - 965 .
Yu G , Ma X , Shen Y , et al . Provable secure identity based generalized signcryption scheme [J]. Theoretical Computer Science , 2010 , 411 ( 40-42 ): 3614 - 3624 .
Kushwah P , Lal S . An efficient identity based generalized signcryption scheme [J]. Theoretical Computer Science , 2011 , 412 ( 45 ): 6382 - 6389 .
Ji H , Han W , Zhao L . Certificateless generalized signcryption [J]. Physics Procedia , 2012 , 33 : 962 - 967 .
Zhou C , Zhou W , Dong X . Provable certificateless generalized signcryption scheme [J]. Designs, Codes and Cryptography , 2014 , 71 ( 2 ): 331 - 346 .
Alkim E , Ducas L , Pöppelmann T , et al . Post‑quantum key exchange—a new hope [A]. The 25th Security Symposium (Security 16) [C]. Austin,USA : USENIX , 2016 . 327 - 343 .
Akleylek S , Bindel N , Buchmann J , et al . An efficient lattice‑based signature scheme with provably secure instantiation [A]. International Conference on Cryptology in Africa [C]. Cham,Germany : Springer , 2016 . 44 - 60 .
Güneysu T , Lyubashevsky V , Pöppelmann T . Practical lattice‑based cryptography: A signature scheme for embedded systems [A]. International Workshop on Cryptographic Hardware and Embedded Systems [C]. Berlin, Heidelberg,Germany : Springer , 2012 . 530 - 547 .
Wang F , Hu Y , Wang C . Post‑quantum secure hybrid signcryption from lattice assumption [J]. Applied Mathematics & Information Sciences , 2012 , 6 ( 1 ): 23 - 28 .
Yan J , Wang L , Wang L , et al . Efficient lattice‑based signcryption in standard model [J]. Mathematical Problems in Engineering , 2013 ,(2013): ArticleID702539.
Lu X , Wen Q , Jin Z , et al . A lattice‑based signcryption scheme without random oracles [J]. Frontiers of Computer Science , 2014 , 8 ( 4 ): 667 - 675 .
Sato S , Shikata J . Lattice‑based signcryption without random oracles [A]. International Conference on Post‑Qua‑ ntum Cryptography (PQCrypto2018) [C]. Cham,Germany : Springer , 2018 . 331 - 351 .
Liu Z Y , Tso R , Tseng Y F , et al . Signcryption from NTRU lattices without random oracles [A]. The 14th Asia Joint Conference on Information Security (AsiaJCIS2019) [C]. USA : IEEE , 2019 . 134 - 141 .
路秀华 , 温巧燕 , 王励成 , 等 . 无陷门格基签密方案 [J]. 电子与信息学报 , 2016 , 38 ( 9 ): 2287 - 2293 .
Fujisaki E , Okamoto T . Secure integration ofasymmetric and symmetric encryption schemes [J]. Journal of Cryptology , 2013 , 26 ( 1 ): 80 - 101 .
Applebaum B , Cash D , Peikert C , et al . Fast cryptographic primitives and circular‑secure encryption based on hard learning problems [A]. Annual International Cryptology Conference [C]. Berlin, Heidelberg,Germany : Springer , 2009 . 595 - 618 .
An J H , Dodis Y , Rabin T . On the security of joint signature and encryption [A]. International Conference on the Theory and Applications of Cryptographic Techniques [C]. Berlin, Heidelberg,Germany : Springer , 2002 . 83 - 107 .
0
浏览量
16
下载量
3
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621