Overflow-detectable Floating-point Fully Homomorphic Encryption

Seunghwan Lee; Dong-Joon Shin

Paper 2022/186

Overflow-detectable Floating-point Fully Homomorphic Encryption

Seunghwan Lee and Dong-Joon Shin

Abstract

We propose a floating-point fully homomorphic encryption (FPFHE) based on torus fully homomorphic encryption equipped with programmable bootstrapping. Specifically, FPFHE for 32-bit and 64-bit floating-point messages are implemented, the latter being state-of-the-art precision in FHEs. Also, a ciphertext is constructed to check if an overflow had occurred or not while evaluating arithmetic circuits with FPFHE, which is useful when the message space or arithmetic circuit is too complex to estimate a bound of outputs such as deep learning applications.

Note: Version 1.2) Errata: Some of the notation N_ct was written n. The l_ks is missing from equation (14). We fixed other typos.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
Keywords: Fully homomorphic encryption
Contact author(s): kr3951 @ hanyang ac kr
djshin @ hanyang ac kr
History: 2022-02-28: last of 3 revisions; 2022-02-20: received; See all versions
Short URL: https://ia.cr/2022/186
License: CC BY

BibTeX

@misc{cryptoeprint:2022/186,
      author = {Seunghwan Lee and Dong-Joon Shin},
      title = {Overflow-detectable Floating-point Fully Homomorphic Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2022/186},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/186}},
      url = {https://eprint.iacr.org/2022/186}
}