一種新型基于環(huán)上帶誤差學(xué)習(xí)問題的認(rèn)證密鑰交換方案
doi: 10.11999/JEIT141506
基金項(xiàng)目:
國家自然科學(xué)基金(61072140, 61373171)，高等學(xué)校博士學(xué)科點(diǎn)專項(xiàng)科研基金(20100203110003)，高等學(xué)校創(chuàng)新引智計劃項(xiàng)目(B08038)，十二五國家密碼發(fā)展基金(MMJJ201401003)和華為技術(shù)有限公司合作項(xiàng)目(YB2013120005)
New Authenticated Key Exchange Scheme Based on Ring Learning with Errors Problem
-
摘要: 利用格上判定帶誤差學(xué)習(xí)問題(Ring-DLWE)困難假設(shè)，該文基于Peikert的調(diào)和技術(shù)構(gòu)造認(rèn)證密鑰交換方案。在標(biāo)準(zhǔn)模型下，該方案是CK模型中可證明安全的，并達(dá)到弱前向安全性(wPFS)。與現(xiàn)有的基于LWE的密鑰交換方案相比，該方案使用平衡的密鑰提取函數(shù)，因而保護(hù)共享會話密鑰，同時因其基于格中困難問題，所以能抵抗量子攻擊。
-
關(guān)鍵詞:
- 密碼學(xué) /
- 格 /
- 認(rèn)證密鑰交換 /
- CK模型 /
- 環(huán)上判定帶誤差學(xué)習(xí)問題(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. -
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. 胡學(xué)先, 魏江宏, 葉茂, 等. 對一個強(qiáng)安全的認(rèn)證密鑰交換協(xié)議的分析[J]. 電子與信息學(xué)報, 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. -
計量
- 文章訪問數(shù): 1409
- HTML全文瀏覽量: 151
- PDF下載量: 752
- 被引次數(shù): 0
下載:
