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

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

Journal on Communications ›› 2013, Vol. 34 ›› Issue (2): 23-30.doi: 10.3969/j.issn.1000-436x.2013.02.004

• Academic paper • Previous Articles Next Articles

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

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

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.

Figures/Tables 1

References 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]. .

Metrics

Recommended 0

No Suggested Reading articles found!

方案	采样数	公钥大小(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

Public-key encryption scheme based on R-LWE

RichHTML

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 1

References 15

Related Articles 10

Metrics

Recommended 0

[1]	Ruizhong DU,Ailun TAN,Junfeng TIAN. Public key searchable encryption scheme based on blockchain [J]. Journal on Communications, 2020, 41(4): 114-122.
[2]	Xixi YAN,Yuan LIU,Zichen LI,Yongli TANG,Qing YE. Privacy-preserving attribute-based encryption scheme on ideal lattices [J]. Journal on Communications, 2018, 39(3): 128-135.
[3]	ANGPan Y,UIXiao-lin G,AOJing Y,INJian-cai L,IANFeng T,HANGXue-jun Z. Research on algorithms of data encryption scheme that supports homomorphic arithmetical operations [J]. Journal on Communications, 2015, 36(1): 167-178.
[4]	Wen-hao LIU,Sheng-bao WANG,Zhen-fu CAO,Li-dong HAN. Provably secure and efficient escrowable public key encryption schemes [J]. Journal on Communications, 2014, 35(7): 33-37.
[5]	. Provably secure and efficient escrowable public key encryption schemes [J]. Journal on Communications, 2014, 35(7): 4-37.
[6]	. Novel construction of forward-secure public-key encryption in the standard model [J]. Journal on Communications, 2014, 35(2): 5-39.
[7]	Yang LU,Ji-guo LI. Novel construction of forward-secure public-key encryption in the standard model [J]. Journal on Communications, 2014, 35(2): 33-39.
[8]	. Efficient chosen-ciphertext secure proxy re-encryption scheme [J]. Journal on Communications, 2013, 34(7): 10-97.
[9]	Wei-wei ZHANG,Ru ZHANG,Jian-yi LIU,Xin-xin NIU,Yi-xian YANG. Efficient chosen-ciphertext secure proxy re-encryption scheme [J]. Journal on Communications, 2013, 34(7): 87-97.
[10]	Yong-gang CUI,Yu-jun LIU. Publicly verifiable public key encryption scheme with short keys [J]. Journal on Communications, 2010, 31(3): 45-50.