利用容错学习问题构造基于身份的全同态加密体制

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

Abstract

Abstract:

The fully homomorphic encryption schemes based on learning with errors problem own a great potential value in the cloud computing security. However, the existing schemes share a common flaw of large sized public keys, which may cause inefficiency of such schemes in the key and identity management. An identity-based fully homomorphic en-cryption scheme was presented. The scheme compromises the merits of both identity-based and fully homomorphic en-cryption schemes, and it overcomes the above mentioned flaw. The security of the proposed scheme reduces to the hard-ness of learning with errors problem and the one-wayness of trapdoor function in the random oracle model.

Key words: learning with error problem, fully homomorphic encryption, identity-based encryption, random oracle model

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.

References 15

[1]	REGEV O . On lattices, learning with errors, random linear codes, and cryptography[A]. Proceeding of the 37th ACM Symposium on Theory of Computing (STOC2005)[C]. Baltimore, MD, USA, 2005.84-93.
[2]	LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings[A]. Proceeding of the 29th Annual Eurocrypt Conference[C]. Riviera, French, 2010.1-23.
[3]	GENTRY C . Fully homomorphic encryption using ideal lattices[A]. Proceeding of the 40st ACM Symposium on Theory of Computing (STOC2009)[C]. Bethesda, Maryland, USA, 2009.169-178.
[4]	DIJK M V , GENTRY C , HALEVI S et al. Fully homomorphic en-cryption over the integers[A]. Proceeding of the 29th Annual Eurocrypt Conference[C]. Riviera, French, 2010.24-43.
[5]	SMART N P , VERCAUTEREN F . Fully homomorphic encryption with relatively small key and ciphertext sizes[A]. Proceeding of the 13th International Conference on Practice and Theory in Public Key Cryptography (PKC2010)[C]. Paris, France, 2010.420-443.
[6]	GENTRY C , HALEVI S . Implementing gentry's fully homomorphic encryption scheme[A]. Proceeding the 30th Annual Eurocrypt Conference[C]. Tallinn, Estonia, 2011.129-148.
[7]	STEHL′E D , STEINFELD R . Faster fully homomorphic encryption[A]. Proceeding of the 16th Annual Asiacrypt Conference[C]. Singapore, 2010.377-394.
[8]	BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard) LWE[A]. Proceeding of IEEE 52nd Annual Symposium on Foundations of Computer Science(FOCS2011)[C]. Palm Springs, CA, USA, 2011.97-106.
[9]	BRAKERSKI Z , GENTR C , VAIKUNTANATHAN V . Fully homomorphic encryption without bootstrapping[A]. Proceeding of Innovations in Theoretical Computer Science 2012[C]. Cambridge, MA, USA, 2012.309-305.
[10]	GENTRY C , HALEVI S , SMART N P . Fully homomorphic encryption with polylog overhead[A]. Proceeding of the 31st Annual Eurocrypt Conference[C]. Canbridge, UK, 2012.465-482.
[11]	GENTRY C , HALEVI S , SMART N P . Better bootstrapping in fully homomorphic encryption[A]. Proceeding of 15th International Conference on Practice and Theory in Public Key Cryptography[C]. Darmstadt, Germany, 2012.1-16.
[12]	SHAMIR A . Identity-based cryptosystems and signature schemes[A]. Proceeding of the 8th Annual International Cryptology Conference[C]. Santa Barbara, California, USA, 1984.47-53.
[13]	HU L , LIU Z L , SUN T et al. Survey of security on identity-based cryptography[A]. Journal of Computer Research and Development[C]. 2009,46(9): 1537-1548.
[14]	PEIKERT C . Public-key cryptosystems from the worst-case shortest vector problem: extended abstract[A]. Proceeding of The 41st ACM Symposium on Theory of Computing (STOC2009)[C]. Bethesda, Maryland, USA, 2009.333-343.
[15]	GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions[A]. Proceeding of the 40th ACM Symposium on Theory of Computing (STOC2008)[C]. Victoria, British Columbia, Canada, 2008.197-206.

Metrics

Recommended 0

No Suggested Reading articles found!

Identity-based fully homomorphic encryption from learning with error problem

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

References 15

Related Articles 15

Metrics

Recommended 0

[1]	Xiao-wei LI,Deng-qi YANG,Ben-hui CHEN,Yu-qing ZHANG. Two-factor authenticated key agreement protocol based on biometric feature and password [J]. Journal on Communications, 2017, 38(7): 89-95.
[2]	Ruo MO,Jian-feng MA,Xi-meng LIU,Qi LI. Multi-authority ABS supporting dendritic access structure [J]. Journal on Communications, 2017, 38(7): 96-104.
[3]	Cheng SONG,Ming-yue ZHANG,Wei-ping PENG,Zong-pu JIA,Zhi-zhong LIU,Xi-xi YAN. Research on batch anonymous authentication scheme for VANET based on bilinear pairing [J]. Journal on Communications, 2017, 38(6): 49-57.
[4]	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.
[5]	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.
[6]	Cheng SONG,Ming-yue ZHANG,Wei-ping PENG,Zong-pu JIA,Zhi-zhong LIU,Xi-xi YAN. Research on pairing-free certificateless batch anonymous authentication scheme for VANET [J]. Journal on Communications, 2017, 38(11): 35-43.
[7]	Qing YE,Ming-xing HU,Yong-li TANG,Kun LIU,Xi-xi YAN. Novel hierarchical identity-based encryption scheme from lattice [J]. Journal on Communications, 2017, 38(11): 54-64.
[8]	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.
[9]	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.
[10]	Zhen-guo ZHAO. Security analysis and improvement of a certificateless signcryption scheme [J]. Journal on Communications, 2015, 36(3): 75-80.
[11]	. Analysis and improvement of an identity-based signcryption [J]. Journal on Communications, 2015, 36(11): 174-179.
[12]	. Verifiable outsourcing private key generation algorithm in an identity-based encryption scheme [J]. Journal on Communications, 2015, 36(11): 61-66.
[13]	Hong-zhen DU,Qiao-yan WEN. Improved certificateless sequential multi-signature scheme [J]. Journal on Communications, 2015, 36(10): 56-61.
[14]	Qing YE,Yun YANG,Shi-hui ZHENG,Li-wei CHANG,Da XIAO,Yi-xian YANG. Fair multi-party concurrent signature scheme [J]. Journal on Communications, 2014, 35(3): 140-149.
[15]	. Fair multi-party concurrent signature scheme [J]. Journal on Communications, 2014, 35(3): 16-149.