一种新型基于环上带误差学习问题的认证密钥交换方案

杨孝鹏; 马文平; 张成丽

doi:10.11999/JEIT141506

一种新型基于环上带误差学习问题的认证密钥交换方案

doi: 10.11999/JEIT141506

基金项目:

国家自然科学基金(61072140, 61373171)，高等学校博士学科点专项科研基金(20100203110003)，高等学校创新引智计划项目(B08038)，十二五国家密码发展基金(MMJJ201401003)和华为技术有限公司合作项目(YB2013120005)

计量
- 文章访问数: 1387
- HTML全文浏览量: 145
- PDF下载量: 752
- 被引次数: 0
出版历程
- 收稿日期: 2014-11-27
- 修回日期: 2015-02-19
- 刊出日期: 2015-08-19

New Authenticated Key Exchange Scheme Based on Ring Learning with Errors Problem

摘要

摘要: 利用格上判定带误差学习问题(Ring-DLWE)困难假设，该文基于Peikert的调和技术构造认证密钥交换方案。在标准模型下，该方案是CK模型中可证明安全的，并达到弱前向安全性(wPFS)。与现有的基于LWE的密钥交换方案相比，该方案使用平衡的密钥提取函数，因而保护共享会话密钥，同时因其基于格中困难问题，所以能抵抗量子攻击。
- 密码学 /
- 格 /
- 认证密钥交换 /
- CK模型 /
- 环上判定带误差学习问题(Ring-DLWE)
Abstract: Using the hard assumption of Ring-Decision Learning With Errors (Ring-DLWE) in the lattice, a new Authenticated Key Exchange (AKE) scheme is proposed, which is based on the Peikerts reconciliation technique. Under the standard model, the proposed scheme is provably secure in the CK model, which is additionally achieves weak Perfect Forward Secrecy (wPFS). Compared with the current Key Exchange (KE) schemes based on the LWE, the proposed scheme not only protects the shared session key with balanced key derivation function but also resists quantum attacks because of the hard assumption on lattice problem.
- Cryptography /
- Lattice /
- Authenticated Key Exchange (AKE) /
- CK model /
- Ring-Decision Learning With Errors (Ring-DLWE)

HTML全文

参考文献(12)

Gentry C, Peikert C, and Vaikuntanathan V. Trapdoor for hard lattices and new cryptographic constructions[C]. Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada, 2008: 197-206.

Regev O. On lattices, learning with errors, random linear codes, and cryptography[J]. Journal of the ACM, 2009, DOI: 10.1145/1568318.1568324.

Peikert C. Public-key cryptosystems for the worst-case shortest vector problem[C]. Proceedings of the 41th Annual ACM Symposium on Theory of Computing, Bethesda, MD, USA, 2009: 333-342.

Lyubashevsky V, Peikert C, and Regev O. On ideal lattices and learning with errors over rings[C]. Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Riviera, France, 2010: 1-23.

Benny A, David C, and Peikert C. Fast cryptographic primitives and circular-secure encryption based on hard learning problems[C]. Proceedings of the 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, 2009: 595-618.

Fujioka A, Suzuki K, Xagawa K, et al.. Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism[C]. Proceedings of the 8th ACM Symposium on Information, Computer, and Communication Security, Hangzhou, China, 2013: 83-94.

胡学先, 魏江宏, 叶茂, 等. 对一个强安全的认证密钥交换协议的分析[J]. 电子与信息学报, 2013, 35(9): 2278-2282.

Hu Xue-xian, Wei Jiang-hong, Ye Mao, et al.. Cryptanalysis of a strongly secure authenticated key exchange protocol[J]. Journal of Electronics Information Technology, 2013, 35(9): 2278-2282.

Lyubashevsky V, Peikert C, and Regev O. A toolkit for ring-LWE cryptography[C]. Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, 2013: 35-54.

Peikert C. Lattice cryptography for the Internet[C]. Proceedings of the 6th International Workshop, Post-Quantum Cryptography, Waterloo, Canada, 2014: 197-219.

Peikert C. An efficient and parallel gaussian sampler for lattices[C]. Proceedings of the 30th Annual International Cryptology Conference, Santa Barbara, CA, USA, 2010: 80-97.

Canetti R and Krawczyk H. Analysis of key-exchange protocols and their use for building secure channels[C]. Proceedings of the 20th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Innsbruck, Austria, 2001: 453-474.

施引文献

资源附件(0)

访问统计