基于RLWE的可证明安全无陷门签密方案

刘镇; 韩益亮; 杨晓元; 柳曙光

doi:10.11959/j.issn.1000-436x.2020093

您当前的位置：

首页 >

文章列表页 >

基于RLWE的可证明安全无陷门签密方案

学术论文 | 更新时间：2024-06-05

- 基于RLWE的可证明安全无陷门签密方案
- Provable security signcryption scheme based on RLWE without trapdoor
- 通信学报 2020年41卷第6期页码：14-25
- 作者机构：
  
  武警工程大学密码工程学院，陕西西安710086
- 作者简介：
  
  [ "刘镇（1985- ），男，湖南衡南人，武警工程大学讲师、博士生，主要研究方向为公钥密码算法、可证明安全等" ]
  [ "韩益亮（1977- ），男，甘肃会宁人，博士，武警工程大学教授，主要研究方向为密码学、隐私保护、社交网络分析等" ]
  [ "杨晓元（1959- ），男，湖南湘潭人，武警工程大学教授，主要研究方向为密码学、信息安全等" ]
  [ "柳曙光（1976- ），男，山东栖霞人，武警工程大学副教授，主要研究方向为计算机应用、信息安全等" ]
- 基金信息：
  
  国家自然科学基金资助项目(61572521);国家自然科学基金资助项目(U1636114);国家自然科学基金资助项目(61772550);国家重点研发计划基金资助项目(2017YFB0802000);武警工程大学创新团队科学基金资助项目(KYTD201805)
- DOI：10.11959/j.issn.1000-436x.2020093
  中图分类号： TP309
- 网络出版日期：2020-06，
  
  纸质出版日期：2020-06-25
- 稿件说明：
移动端阅览
刘镇, 韩益亮, 杨晓元, 等. 基于RLWE的可证明安全无陷门签密方案[J]. 通信学报, 2020,41(6):14-25.

Zhen LIU, Yiliang HAN, Xiaoyuan YANG, et al. Provable security signcryption scheme based on RLWE without trapdoor[J]. Journal on communications, 2020, 41(6): 14-25.
刘镇, 韩益亮, 杨晓元, 等. 基于RLWE的可证明安全无陷门签密方案[J]. 通信学报, 2020,41(6):14-25. DOI： 10.11959/j.issn.1000-436x.2020093.

Zhen LIU, Yiliang HAN, Xiaoyuan YANG, et al. Provable security signcryption scheme based on RLWE without trapdoor[J]. Journal on communications, 2020, 41(6): 14-25. DOI： 10.11959/j.issn.1000-436x.2020093.

摘要

针对现有基于格的签密存在的效率与安全性问题，基于ABB16的签名方案ring-TESLA，构造了一个在机密性和认证性方面分别达到自适应抗选择密文攻击不可区分安全性和抗选择消息攻击强不可伪造安全性的无陷门签密方案RLWE-SC，其安全性可规约到环上带差错的学习问题。环上的构造方式优化了方案的公私钥尺寸，无陷门的构造方式避免了方案使用复杂的陷门产生和原像抽样运算。效率分析与实验表明，与现有的同等安全强度的格签密方案相比，RLWE-SC具有较高的计算和通信效率。

Abstract

In view of the existing efficiency and security problems of lattice based signcryption

with the ABB16’s signature scheme ring-TESLA

a signcryption scheme without trapdoor named RLWE-SC was constructed

which achieved indistinguish ability against adaptive chosen cipher text attack (IND-CCA2) security and strongly existential unforgeability against chosen message attack (SUF-CMA) security respectively in terms of confidentiality and authentication based on the problem of learning with errors on ring.The size of the public and private keys was optimized by the construction on the ring.The complex trapdoor generation and preimage sample calculation was avoided by the structure without trapdoor.Efficiency analysis and experiment shows that RLWE-SC has better computational and communication performance than other similar lattice-based signcryption schemes with the same security strength.

关键词

Keywords

references

ZHENG Y , . Digital signcryption or how to achieve cost (signature ＆encryption) <<cost (signature) + cost (encryption) [C ] // Annual International Cryptology Conference . Berlin:Springer , 1997 : 165 - 179 .

ZHENG Y , IMAI H . How to construct efficient signcryption schemes on elliptic curves [J ] . Information Processing Letters , 1998 , 68 ( 5 ): 227 - 233 .

STEINFELD R , ZHENG Y . A signcryption scheme based on integer factorization [C ] // International Workshop on Information Security . Berlin:Springer , 2000 : 308 - 322 .

MICCIANCIO D . Lattice-based cryptography [J ] . Encyclopedia of Cryptography and Security , 2011 : 713 - 715 .

LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings [J ] . Journal of the ACM , 2013 , 60 ( 6 ):43.

LYUBASHEVSKY V , . Lattice signatures without trapdoors [C ] // Annual International Conference on the Theory and Applications of Cryptographic Techniques . Berlin:Springer , 2012 : 738 - 755 .

AKLEYLEK S , BINDEL N , BUCHMANN J , et al . An efficient lattice-based signature scheme with provably secure instantiation [C ] // International Conference on Cryptology in Africa . Berlin:Springer , 2016 : 44 - 60 .

WANG F , HU Y , WANG C . Post-quantum secure hybrid signcryptionfrom lattice assumption [J ] . Applied Mathematics ＆ Information Sciences , 2012 , 6 ( 1 ): 23 - 28 .

FAGEN L , FAHAD T , BIN M , et al . Lattice-based signcryption [J ] . Concurrency and Computation:Practice and Experience , 2013 , 25 ( 14 ): 2112 - 2122 .

YAN J , WANG L , WANG L , et al . Efficient lattice-based signcryption in standard model [J ] . Mathematical Problems in Engineering , 2013 , 2013 : 1 - 18 .

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 .

BAI S , GALBRAITH S D . An improved compression technique for signatures based on learning with errors [C ] // Cryptographers’ Track at the RSA Conference . Berlin:Springer , 2014 : 28 - 47 .

LU X , WEN Q , WANG L , et al . A lattice-based signcryption scheme without trapdoors [J ] . Journal of Electronics and Information , 2016 , 38 ( 9 ): 2287 - 2293 .

GERARD F , MERCKX K . Setla:signature and encryption from lattices [C ] // International Conference on Cryptology and Network Security . Berlin:Springer , 2018 : 299 - 320 .

ALKIM E , DUCAS L , PÖPPELMANN T . et al Post-quantum keyexchange-a new hope [C ] // 25th USENIX Security Symposium (USENIX Security 2016) . Berkeley:USENIX Association , 2016 : 327 - 343 .

SATO S , SHIKATA J . Lattice-based signcryption without random oracles [C ] // International Conference on Post-Quantum Cryptography(PQCrypto2018) . Berlin:Springer , 2018 : 331 - 351 .

LIU Z Y , TSO R , TSENG Y F , et al . Signcryption from NTRU lattices without random oracles [C ] // 14th Asia Joint Conference on Information Security (AsiaJCIS2019) . Piscataway:IEEE Press , 2019 : 134 - 141 .

DEL P R , LYUBASHEVSKY V , POINTCHEVAL D . The whole is less than the sum of its parts:constructing more efficient lattice-based AKEs [C ] // International Conference on Security and Cryptography for Networks . Berlin:Springer , 2016 : 273 - 291 .

ZHANG Y H , HU Y , XIE J , et al . Efficient ring signature schemes over NTRU lattices [J ] . Security and Communication Networks , 2016 , 9 ( 18 ): 5252 - 5261 .

YANG X , CAO H , LI W , et al . Improved lattice-based signcryption in the standard model [J ] . IEEE Access , 2019 , 7 : 155552 - 155562 .

LIU Z , HAN Y L , YANG X Y . A signcryption scheme based learning with errors over rings without trapdoor [C ] // National Conference of Theoretical Computer Science . Berlin:Springer , 2019 : 168 - 180 .

FUJISAKI E , OKAMOTO T . Secure integration of asymmetric 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 [C ] // Annual International Cryptology Conference . Berlin:Springer , 2009 : 595 - 618 .

HUANG Q , WONG D S , ZHAO Y . Generic transformation to strongly unforgeable signatures [C ] // International Conference on Applied Cryptography and Network Security . Berlin:Springer , 2007 : 1 - 17 .

AN J H , DODIS Y , RABIN T . On the security of joint signature and encryption [C ] // In Proceedings Advances inCryptology-EUROCRYPT 2002,LNCS 2332 . Berlin:Springer , 2002 : 83 - 107 .

NANDI M , PANDIT T . Generic conversions from CPA to CCA secure functional encryption [J ] . IACR Cryptology ePrint Archive,2015 , 2015 :457.

LYUBASHEVSKY V , MICCIANCIO D . Asymptotically efficient lattice-based digital signatures [C ] // Theory of Cryptography Conference . Berlin:Springer , 2008 : 37 - 54 .

浏览量

889

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于无证书签密的车联社会网络安全通信机制

基于Cocks身份密码体制的高效签密方案

基于编码的多接收方广义签密方案

无证书签密机制的安全性分析与改进

可证安全的有效代理签名方案