基于R-LWE的公钥加密方案

doi:10.3969/j.issn.1000-436x.2013.02.004

通信学报 ›› 2013, Vol. 34 ›› Issue (2): 23-30.doi: 10.3969/j.issn.1000-436x.2013.02.004

基于R-LWE的公钥加密方案

杨晓元^1,²,吴立强¹,张敏情¹,张薇¹

¹ 武警工程大学电子技术系网络与信息安全武警部队重点实验室，陕西西安710086
² 西安电子科技大学网络信息安全教育部重点实验室，陕西西安 710071

出版日期:2013-02-25 发布日期:2017-07-17
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;陕西省自然科学基金资助项目

Public-key encryption scheme based on R-LWE

Xiao-yuan YANG^1,²,Li-qiang WU¹,Min-qing ZHANG¹,Wei ZHANG¹

¹ Key Laboratory of Network ＆ Information Security Under the Chinese Armed Police Force, Department of Electronic Technology, Engineering University of the Armed Police Force, Xi’an 710086,China
² Key Laboratory of Network ＆ Information Security, Ministry of Education, Xidian University, Xi’an 710071,China

Online:2013-02-25 Published:2017-07-17
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Natural Science Foundation of Shaanxi Province

摘要/Abstract

摘要：

摘要：根据一个更紧凑的均匀性定理提出了一种改进的理想格上陷门生成方法；然后结合 R-LWE 加密算法和理想格上强不可伪造一次签名工具，在标准模型下设计了一个适应性选择密文攻击(CCA)安全的公钥加密方案。新方案可实现块加密，可支持公开的密文完整性验证，具有加解密速度快、密文扩展率低的优势，其安全性可以高效地归约为判定性R-LWE困难性假设。新方案是第一个完全基于理想格上困难问题构造的CCA安全公钥加密方案。

关键词: 公钥加密, 适应性选择密文安全, 理想格, R-LWE

Abstract:

An improved method of generating trapdoor on ideal lattice was proposed by a stronger regularity bound theorem, then with R-LWE encryption algorithm and strongly unforgeable one-time signature tool from ideal lattice, an adaptive chosen-ciphertext attack (CCA) secure PKE scheme under the st rd model was designed.The new PKE scheme supported public ciphertext integrity verification, could achieve block encryption and had a high encryption/decryption speed and a low encryption blowup factor, whose security proved reduced to decisional R-LWE assumption tightly.The construction is the first CCA-secure PKE cryptosystem completely based on hard problems from ideal lattice.

Key words: public key encryption, chosen-ciphertext security, ideal lattice, R-LWE

杨晓元,吴立强,张敏情,张薇. 基于R-LWE的公钥加密方案[J]. 通信学报, 2013, 34(2): 23-30.

Xiao-yuan YANG,Li-qiang WU,Min-qing ZHANG,Wei ZHANG. Public-key encryption scheme based on R-LWE[J]. Journal on Communications, 2013, 34(2): 23-30.

图/表 1

参考文献 15

[1]	CHARLES R , DANIEL R . Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack[A]. Cryptology -Crypto’91[C]. California USA, 1991.433-444.
[2]	ODED R . On lattice, learning with errors, random linear codes, and cryptography[A]. Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing ACM[C]. New York, USA, 2005.84-93.
[3]	CRAIG G , CHRIS P , VINOD V . Trapdoors for hard lattices and new cryptographic constructions[A]. STOC 2008[C]. Victoria, British Columbia, Canada, 2008.197-206.
[4]	SHWETA A , DAN B , XAVIER B . Efficient lattice (H) IBE in the standard model[A]. Cryptology-EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications f Cryptographic Techniques[C]. French Riviera, 2010.553-572.
[5]	VADIM L , CHRIS P , ODED R . On ideal Lattices and learning with errors over rings[A]. Cryptology-EUROCRYPT 2010:29th Annual International Conference on the Theory and Applications f Cryptographic Techniques[C]. French Riviera, 2010.1-23.
[6]	CHRIS P , BRENT W . Lossy trapdoor functions and their application[A]. STOC 2008[C]. Victoria, British Columbia, Canada, 2008.187-196.
[7]	CHRIS P . Public-key cryptosystems from the worst-case shortest vector problem[A]. STOC 2009[C]. Bethesda, Maryland, 2009.333-342.
[8]	XAVIER B , MEI Q X , BRENT W . Dircet chosen ciphertext security from identity-based techniques[A]. Proceedings of the ACM CCS[C]. Alexandria, VAUSA, 2005.320-329.
[9]	DAMIEN S , STEINFELD R . Making NTRU as secure as worst-case problems over ideal lattices[A]. Cryptology-EUROCRYPT 2011: 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques[C]. French Riviera, 2011.24-47.
[10]	DAMIEN S , STEINFELD R , TANAKA K . Effcient public key encryption based on ideal lattices[A]. ASIACRYPT 2009[C]. Springer, 2009.617-635.
[11]	VADIM L , MICCIANCIO D . Generalized compact knapsacks are collision resistant[A]. ICALP 2006:33rd International Colloquium on Automata, Languages and Programming[C]. Italy, 2006.144-155.
[12]	VADIM L , MICCIANCIO D . Asymptotically efficient lattice-based digital signatures[A]. Proceedings of TCC 2008[C]. Springer, 2008.37-54.
[13]	MICCIANCIO D . Generalized compact knapsacks, cyclic lattices, and efficient one way functions [J]. Computational Complexity, Springer, 2007,16(4): 365-411.
[14]	VADIM L , MICCIANCIO D , CHRIS P . A modest proposal for FFT hashing[A]. Fast Software Encryption, 15th International Workshop, FSE 2008[C]. Lausanne, Switzerland, 2008.54-72.
[15]	DENT A W . A note on game-hopping proofs[EB/OL]. .

方案	采样数	公钥大小(bit)	一次可加密明文	密文扩展率	运算方法	支持公开完整性验证
Peikert方案^[7]	m=W(nlog ²q)	kmn log q	{0,1}^l	(km/l+1)log q	矩阵运算	×
本文	m =W(logq)	kmn log q	{0,1}^n×l	(km/l+1)log q	FFT运算	v

基于R-LWE的公钥加密方案

Public-key encryption scheme based on R-LWE

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献 15

相关文章 8

Metrics

推荐阅读 0

[1]	杜瑞忠,谭艾伦,田俊峰. 基于区块链的公钥可搜索加密方案[J]. 通信学报, 2020, 41(4): 114-122.
[2]	闫玺玺,刘媛,李子臣,汤永利,叶青. 理想格上支持隐私保护的属性基加密方案[J]. 通信学报, 2018, 39(3): 128-135.
[3]	杨攀,桂小林,姚婧,林建财,田丰,张学军. 支持同态算术运算的数据加密方案算法研究[J]. 通信学报, 2015, 36(1): 167-178.
[4]	刘文浩，王圣宝，曹珍富，韩立东. 可证安全的高效可托管公钥加密方案[J]. 通信学报, 2014, 35(7): 4-37.
[5]	刘文浩,王圣宝,曹珍富,韩立东. 可证安全的高效可托管公钥加密方案[J]. 通信学报, 2014, 35(7): 33-37.
[6]	陆阳，李继国. 标准模型下前向安全公钥加密方案的新构造[J]. 通信学报, 2014, 35(2): 5-39.
[7]	陆阳,李继国. 标准模型下前向安全公钥加密方案的新构造[J]. 通信学报, 2014, 35(2): 33-39.
[8]	崔永刚,刘玉军. 可公开验证的短密钥公钥加密方案[J]. 通信学报, 2010, 31(3): 45-50.