Detailed Information

Bootstrapping for approximate homomorphic encryption

Cited 125 time in Web of Science Cited 142 time in Scopus

Cheon, Jung Hee; Han, Kyoohyung; Kim, Andrey; Kim, Miran; Song, Yongsoo

Issue Date
Springer Verlag
Lecture Notes in Computer Science, Vol.10820, pp.360-384
© International Association for Cryptologic Research 2018.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 Gentrys 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.8s to refresh a ciphertext that encrypts 128numbers with 12bits of precision, yielding an amortized rate of 1.1seconds per slot.
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Related Researcher

  • College of Engineering
  • Dept. of Computer Science and Engineering
Research Area Cryptography, Privacy, Security


Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.