Double Batch for RLWE-Based Leveled Fully Homomorphic Encryption

CHEN Hu; HU Yupu; LIAN Zhizhu

doi:10.1049/cje.2015.07.038

Volume 24 Issue 3

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2015 > 24(3): 661-666

CHEN Hu, HU Yupu, LIAN Zhizhu, “Double Batch for RLWE-Based Leveled Fully Homomorphic Encryption,” Chinese Journal of Electronics, vol. 24, no. 3, pp. 661-666, 2015, doi: 10.1049/cje.2015.07.038

Citation:

CHEN Hu, HU Yupu, LIAN Zhizhu, “Double Batch for RLWE-Based Leveled Fully Homomorphic Encryption,” Chinese Journal of Electronics, vol. 24, no. 3, pp. 661-666, 2015, doi: 10.1049/cje.2015.07.038

CHEN Hu, HU Yupu, LIAN Zhizhu, “Double Batch for RLWE-Based Leveled Fully Homomorphic Encryption,” Chinese Journal of Electronics, vol. 24, no. 3, pp. 661-666, 2015, doi: 10.1049/cje.2015.07.038

Citation:

PDF( 254 KB)

Double Batch for RLWE-Based Leveled Fully Homomorphic Encryption

doi: 10.1049/cje.2015.07.038

State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China

Funds: This work is supported by the National Natural Science Foundation of China (No.61472309, No.61173151) and the Natural Science Foundation of Anhui Province (No.1208085MF108, No.KJ2012B157).

Received Date: 2014-05-19
Rev Recd Date: 2015-01-06
Publish Date: 2015-07-10

Abstract

Abstract

To further improve the efficiency of Fully homomorphic encryption (FHE), a leveled FHE scheme based on the Ring learning with errors (RLWE) problem is put forward by simultaneously applying both batch techniques available. Our scheme therefore allows double packing many plaintext values into each ciphertext to support single-instruction-multiple-data-type operations, which effectively reduces the ciphertext expansion ratio. An efficient evolutionary method for achieving arbitrary homomorphic permutation operations on a packed ciphertext is also provided by using several given key-switching hints. Further, a few new operations are introduced, with which not only to describe the key switching process in our batch setting clearly, but also to analyze the noise growth conveniently.
- Fully homomorphic encryption,
- Ring learning with errors,
- Batch technique,
- Circular security

FullText(HTML)

References(17)

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 41st ACM Symp. on Theory of Computing (STOC), pp.97-106, 2011.

M.V. Dijk, C. Gentry, S. Halevi, et al., "Fully homomorphic encryption over the integers", Proc. of EUROCRYPT 2010, LNCS 6110, pp.24-43, 2010.

Z. Brakerski, C. Gentry and V. Vaikuntanathan, "Fully homomorphic encryption without bootstrapping", Proc. of Innovations in Theoretical Computer Science, pp.309-325, 2012.

Z. Brakerski, "Fully homomorphic encryption without modulus switching from classical gapsvp", Proc. of CRYPTO 2012, LNCS 7417, pp.868-886, 2012.

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

J.S. Coron, T. Lepoint and M. Tibouchi, "Scale-invariant fully homomorphic encryption over the integers", Proc. of PKC 2014, LNCS 8383, pp.311-328, 2014.

N.P. Smart and F. Vercauteren, "Fully homomorphic simd operations", Designs, Codes and Cryptography, Vol.71, No.1, pp.57- 81, 2011.

C. Gentry, S. Halevi and N.P. Smart, "Fully homomorphic encryption with polylog overhead", Proc. of EUROCRYPT 2012, LNCS 7237, pp.465-482, 2012.

Z. Brakerski, C. Gentry and S. Halevi, "Packed ciphertexts in lwe-based homomorphic encryption", Proc. of PKC 2013, LNCS 7778, pp.1-13, 2013.

J.H. Cheon, J.S. Coron, J. Kim, et al., "Batch fully homomorphic encryption over the integer", Proc. of EUROCRYPT 2013, LNCS 7881, pp.315-335, 2013.

J. Alperin-Sheriff and C. Peikert, "Faster bootstrapping with polynomial error", Proc. of CRYPTO 2014, LNCS 8616, pp.297-314, 2014.

A. Lopez-Alt, E. Tromer and V. Vaikuntanathan, "On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption", Proc. of STOC 2012, pp.1219-1234, 2012.

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

C. Peikert, V. Vaikuntanathan and B.Waters, "A framework for efficient and composable oblivious transfer", Proc. of CRYPTO 2008, LNCS 5157, pp.554-571, 2008.

J. Fan, et al., "Somewhat practical fully homomorphic encryption", available at http://eprint.iacr.org/ 2012/144,pdf, 2014-5.

V. Lyubashevsky, C. Peikert and O. Regev, "On ideal lattices and learning with errors over rings", Journal of the ACM, Vol.60, No.6, pp.1-35, 2013.

Relative Articles

Supplements(0)

Cited By

Proportional views