Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / Fully homomorphic encryption

Date: received 17 Feb 2022, last revised 28 Feb 2022

Contact author: kr3951 at hanyang ac kr, djshin at hanyang ac kr

Available format(s): PDF | BibTeX Citation

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.

Version: 20220228:064846 (All versions of this report)

Short URL: ia.cr/2022/186


[ Cryptology ePrint archive ]