Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE

Abstract : In this paper, we present several methods to improve the evaluation of homomorphic functions in TFHE, both for fully and for leveled homomorphic encryption. We propose two methods to manipulate packed data, in order to decrease the ciphertext expansion and optimize the evaluation of look-up tables and arbitrary functions in RingGSW based homomorphic schemes. We also extend the automata logic, introduced in [12, 19], to the efficient leveled evaluation of weighted automata, and present a new homomorphic counter called TBSR, that supports all the elementary operations that occur in a multiplication. These improvements speed-up the evaluation of most arithmetic functions in a packed leveled mode, with a noise overhead that remains additive. We finally present a new circuit bootstrapping that converts LWE into low-noise RingGSW ciphertexts in just 137 ms, which makes the leveled mode of TFHE composable, and which is fast enough to speed-up arithmetic functions, compared to the gate-by-gate bootstrapping given in [12]. Finally, we propose concrete parameter sets and timing comparison for all our constructions.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01832760
Contributor : Léna Le Roy <>
Submitted on : Monday, July 9, 2018 - 8:20:28 AM
Last modification on : Wednesday, January 23, 2019 - 2:39:33 PM

Identifiers

Citation

I. Chillotti, N. Gama, M. Georgieva, M. Izabachène. Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE. Advances in Cryptology – ASIACRYPT 2017. ASIACRYPT 2017. Lecture Notes in Computer Science, Dec 2017, Hong Kong, China. pp.377-408, ⟨10.1007/978-3-319-70694-8_14⟩. ⟨cea-01832760⟩

Share

Metrics

Record views

51