Leveled Homomorphic Encryption in Certificateless Cryptosystem

CHEN Hu; HU Yupu; LIAN Zhizhu

doi:10.1049/cje.2017.07.008

Volume 26 Issue 6

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2017 > 26(6): 1213-1220

CHEN Hu, HU Yupu, LIAN Zhizhu, “Leveled Homomorphic Encryption in Certificateless Cryptosystem,” Chinese Journal of Electronics, vol. 26, no. 6, pp. 1213-1220, 2017, doi: 10.1049/cje.2017.07.008

Citation:

CHEN Hu, HU Yupu, LIAN Zhizhu, “Leveled Homomorphic Encryption in Certificateless Cryptosystem,” Chinese Journal of Electronics, vol. 26, no. 6, pp. 1213-1220, 2017, doi: 10.1049/cje.2017.07.008

CHEN Hu, HU Yupu, LIAN Zhizhu, “Leveled Homomorphic Encryption in Certificateless Cryptosystem,” Chinese Journal of Electronics, vol. 26, no. 6, pp. 1213-1220, 2017, doi: 10.1049/cje.2017.07.008

Citation:

PDF( 216 KB)

Leveled Homomorphic Encryption in Certificateless Cryptosystem

doi: 10.1049/cje.2017.07.008

1.
State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China;
2.
Jiangsu Key Laboratory of Education Big Data Science and Engineering, Jiangsu Normal University, Xuzhou 221116, China

Funds: This work is supported by the National Natural Science Foundation of China (No.61472309, No.61672412, No.61373171), the Natural Science Foundation of Anhui Higher Education Institutions (No.KJ2016A626, No.KJ2016A627), and Foundation of Jiangsu Normal University (No.16XLR031).

Received Date: 2015-05-04
Rev Recd Date: 2016-01-19
Publish Date: 2017-11-10

Abstract

Abstract

To lower communication complexity, a Certificateless homomorphic encryption (CLHE) scheme based on the Learning with errors (LWE) problem is constructed by introducing a new technique called probabilistic encoding with weakly homomorphic property. This technique can conveniently convert an intended message into two elements in a ring, which will be respectively encrypted under both public keys of a user in certificateless cryptosystem. Upon knowing both elements simultaneously, the original message can be easily recovered. It is hidden perfectly by the probabilistic property of encoding. This CLHE removes evaluation keys by using the approximate eigenvector method given by Gentry et al., which makes it into a pure CLHE. It is proven to be semantic secure in the Random oracle model (ROM). The results indicate it is able to homomorphically evaluate any functions in a class functions with given multiplicative depth L.
- Certificateless cryptosystem,
- Lattice cryptography,
- Fully homomorphic encryption,
- Learning with errors,
- Random oracle model

FullText(HTML)

References(20)

References

C. Gentry, "A fully homomorphic encryption scheme", Ph.D. Thesis, Stanford University, USA, 2009.

Z. Brakerski and V. Vaikuntanathan, "Efficient fully homomorphic encryption from (standard) LWE", Proc. of FOCS 2011, Palm Springs, California, USA, pp.97-106, 2011.

Z. Brakerski, C. Gentry and V. Vaikuntanathan, "Leveled fully homomorphic encryption without bootstrapping", Proc. of ITCS 2012, Massachusetts, USA, pp.309-325, 2012.

Z. Brakerski and V. Vaikuntanathan, "Lattice-based FHE as secure as PKE", Proc. of ITCS 2014, Princeton, New Jersey, USA, pp.1-12, 2014.

H. Chen, Y.P. Hu and Z.Z. Lian, "Double batch for RLWEbased leveled fully homomorphic encryption", Chinese Journal of Electronics, Vol.24, No.3, pp.661-666, 2015.

J. W. Bos, K. Lauter, J. Loftus, et al., "Improved security for a ring-based fully homomorphic encryption scheme", Proc. of IMACC 2013, Oxford, UK, LNCS 8308, pp.45-64, 2013.

C. Gentry, A. Sahai and B. Waters, "Homomorphic encryption from learning with errors:Conceptually-simpler, asymptotically-faster, attribute-based", Proc. of CRYPTO 2013, Santa Barbara, CA, USA, Part I, LNCS 8042, pp.75-92, 2013.

M. Clear and C. McGoldrick, "Bootstrappable identity-based fully homomorphic encryption", Proc. of CANS 2014, Heraklion, Crete, Greece, LNCS 8813, pp.1-19, 2014.

C. Gentry, S. Halevi and N.P. Smart, "Homomorphic evaluation of the AES circuit", Proc. of CRYPTO 2012, Santa Barbara, CA, USA, LNCS 7417, pp.850-867, 2012.

S.S. Al-Riyami and K.G. Paterson, "Certificateless public key cryptography", Proc. of ASIACRYPT 2003, Taipei, Taiwan, LNCS 2894, pp.452-473, 2003.

S.K. Li, "Provable secure certificateless fully homomorphic encryption scheme in standard model", Journal of Computer Applications, Vol.35, No.2, pp.387-392, 2015. (in Chinese)

Y. Guang, C.X. Gu, Y.F. Zhu, et al., "Certificateless fully homomorphic encryption based on LWE problem", Journal of Electronic & Information Technology, Vol.35, No.4, pp.988-993, 2013. (in Chinese)

H. Chen, S.M. Wei, C.J. Zhu, et al., "Secure certificateless aggregate signature scheme", Journal of Software, Vol.26, No.5, pp.1173-1180, 2015. (in Chinese)

C. Gentry, C. Peikert and V. Vaikuntanathan, "Trapdoors for hard lattices and new cryptographic constructions", Proc. of STOC 2008, British Columbia, Canada, pp.197-206, 2008.

D. Micciancio and C. Peikert, "Trapdoor for lattices:Simpler, tighter, faster, smaller", Proc. of EUROCRYPT 2012, Cambridge, UK, LNCS 6223, pp.191-208, 2012.

C. Gentry, S. Halevi and V. Vaikuntanathan, "A simple BGNtype cryptosystem from LWE", Proc. of EUROCRYPT 2010, Monaco and Nice, French, LNCS 6110, pp.506-522, 2010.

S. Agrawal, D. Boneh and X. Boyen, "Efficient lattice (H)IBE in the standard model", Proc. of EUROCRYPT 2010, Monaco and Nice, French, LNCS 6110, pp.553-572, 2010.

A. Dent, "A survey of certificateless encryption schemes and security models", International Journal of Information Security, Vol.7, No.5, pp.347-377, 2008.

J. Alwen and C. Peikert, "Generating shorter bases for hard random lattices", Theory of Computing Systems, Vol.48, No.3, pp.535-553, 2011.

V.V. Williams, "Multiplying matrices faster than coppersmithwinograd", Proc. of STOC 2012, New York, USA, ACM Press, pp.887-898, 2012.

Relative Articles

Supplements(0)

Cited By

Proportional views