Cryptology ePrint Archive: Report 2018/153

Bootstrapping for Approximate Homomorphic Encryption

Jung Hee Cheon and Kyoohyung Han and Andrey Kim and Miran Kim and Yongsoo Song

Abstract: This paper extends the leveled homomorphic encryption scheme for an approximate arithmetic of Cheon et al. (ASIACRYPT 2017) to a fully homomorphic encryption, i.e., we propose a new technique to refresh low-level ciphertexts based on Gentry's bootstrapping procedure.

The modular reduction operation is the main bottleneck in the homomorphic evaluation of the decryption circuit. We exploit a scaled sine function as an approximation of the modular reduction operation and present an efficient evaluation strategy. Our method requires only one homomorphic multiplication for each of iterations and so the total computation cost grows linearly with the depth of the decryption circuit.

We also show how to recrypt packed ciphertexts on the RLWE construction with an open-source implementation. For example, it takes 139.8 seconds to refresh a ciphertext that encrypts 128 numbers with 12 bits of precision, yielding an amortized rate of 1.1 seconds per slot.

Category / Keywords: public-key cryptography / Homomorphic encryption, approximate arithmetic, bootstrapping

Original Publication (in the same form): IACR-EUROCRYPT-2018

Date: received 7 Feb 2018

Contact author: lucius05 at snu ac kr

Available format(s): PDF | BibTeX Citation

Version: 20180211:143137 (All versions of this report)

Short URL: ia.cr/2018/153


[ Cryptology ePrint archive ]