基于RLWE的全同态加密方案

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

Abstract

Abstract:

Based on the somewhat homomorphic scheme of Kristin Lauter et al.a new technique,called Relinearization with key switching was presented.Combining this technique with modulus switching,a (leveled) fully homomorphic encryption scheme without bootstrapping from RLWE were designed.Homomorphic operations of this scheme is simple,and trivial gate operation given in the scheme can make level structure of circuit clearer.Finally,bootstrapping was used as optimization to evaluate capability of the proposed scheme.

Key words: fully homomorphic encryption, relinearization, modulus switching

Dian-hua TANG,Shi-xiong ZHU,Lin WANG,Hao-miao YANG,Jia FAN. Fully homomorphic encryption scheme from RLWE[J]. Journal on Communications, 2014, 35(1): 173-182.

Figures/Tables 1

References 19

[1]	RIVEST R L , ADLEMAN L , DERTOUZOS M L . On data banks and privacy homomorphisms[A]. Foundations of Secure Computation[C]. 1978. 169-180.
[2]	PAILLIER P . Public-key cryptosystems based on composite degree residuosity classes[A]. EUROCRYPT'99[C]. Spring, 1999. 223-238.
[3]	RIVEST R L , SHAMIR A , ADLEMAN L . A method for obtaining digital signatures public key cryptosystem[J]. Communication of ACM, 1978,21(1): 120-126.
[4]	BONEH D , GOH E J , NISSIM K . Evaluating 2-DNF formulas on ciphertexts[A]. Proceedings of Theory of Cryptography Conference 2005[C]. 2005. 325-342.
[5]	GENTRY C . Fully homomorphic encryption using ideal lattices[A]. The 41st ACM Symposium on Theory of Computing (STOC)[C]. 2009. 169-178.
[6]	GENTRY C . A Fully Homomorphic Encryption Scheme[D]. Standford:Stanford University, 2009.
[7]	DIJK M , GENTRY C , HALEVI S ,et al. Fully homomorphic encryptionover the integers[A]. Cryptology-EUROCRYPT’10[C]. 2010. 24-43.
[8]	SMART N , VERCAUTEREN F . Fully homomorphic encryption with relatively small key and ciphertext sizes[A]. PKC 2010[C]. 2010. 420-443.
[9]	GENTRY C , HALEVI S . Implementing gentry’s fully-homomorphic encryption scheme[A]. EUROCRYPT,Lecture Notes in Computer Science[C]. 2011. 129-148.
[10]	GENTRY C , HALEVI S . Fully homomorphic encryption without squashing using depth-3 arithmetic circuits[EB/OL]. , 2011.
[11]	BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard)lwe[EB/OL]. , 2011.
[12]	BRAKERSKI Z , GENTRY C . Fully homomorphic encryption without bootstrapping[EB/OL]. , 2011.
[13]	LAUTER K , NAEHRIG M , VAIKUNTANATHAN V . Can homo morphic encryption be practical?[EB/OL]. , 2011.
[14]	LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings[A]. EUROCRYPT,Lecture Notes in Computer Science[C]. 2010. 1-23.
[15]	MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on gaussian measures[J].SIAM J Comput,2007.37(1):267-302.　　　　　　　SIAM J Comput, 2007,37(1): 267-302.
[16]	KARP R M , RAMACHANDRAN V . A Survey of Parallel Algorithms for Shared-Memory Machines[R]. Technical Report CSD-88-408,UC Berkeley, 1988.
[17]	LINDNER R , PEIKERT C . Better key sizes (and attacks) for LWE-based encryption[A]. Cryptology-CT-RSA 2011,Lecture Notes in Computer Science[C]. 2011. 319-339.
[18]	BANASZCZYK W . New bounds in some transference theorems in the geometry of numbers[J]. Mathematische Annalen, 1993,296(4): 625-635.
[19]	GAMA N , NGUYEN P Q . Predicting lattice reduction[A]. Cryptology-EUROCRYPT 2008,Lecture Notes in Computer Science[C]. Springer, 2008. 31-51.

Metrics

Recommended 0

No Suggested Reading articles found!

Fully homomorphic encryption scheme from RLWE

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 19

Related Articles 6

Metrics

Recommended 0

[1]	Yong-li TANG,Ming-xing HU,Kun LIU,Qing YE,Xi-xi YAN. Novel identity-based fully homomorphic encryption scheme from lattice [J]. Journal on Communications, 2017, 38(5): 39-47.
[2]	Yong-hui ZHENG,Yuan-ji KANG,Chun-xiang GU,Hui DONG. Attribute-based fully homomorphic encryption scheme over rings [J]. Journal on Communications, 2017, 38(4): 55-63.
[3]	Ran DUAN,Chun-xiang GU,Yue-fei ZHU,Yong-hui ZHENG,Li CHEN. Efficient identity-based fully homomorphic encryption over NTRU [J]. Journal on Communications, 2017, 38(1): 66-75.
[4]	Ze-dong SUN,Yue-fei ZHU,Chun-xiang GU,Yong-hui1 ZHENG. RLWE-based key-policy ABE scheme [J]. Journal on Communications, 2016, 37(Z1): 125-131.
[5]	. Identity-based fully homomorphic encryption from learning with error problem [J]. Journal on Communications, 2014, 35(2): 15-117.
[6]	Yan GUANG,Yue-fei ZHU,Jin-long FEI,Chun-xiang GU,Yong-hui ZHENG. Identity-based fully homomorphic encryption from learning with error problem [J]. Journal on Communications, 2014, 35(2): 111-117.