@inproceedings{a581aeaf12394d2db469363fb0fdf8ce,
title = "More Efficient Functional Bootstrapping for General Functions in Polynomial Modulus",
abstract = "Functional bootstrapping seamlessly integrates the benefits of homomorphic computation using a look-up table and the noise reduction capabilities of bootstrapping. Its wide-ranging applications in privacy-preserving protocols underscore its broad impacts and significance. In this work, our objective is to craft more efficient and less restricted functional bootstrapping methods for general functions within a polynomial modulus. We introduce a series of novel techniques, proving that functional bootstrapping for general functions can be essentially as efficient as regular FHEW/TFHE bootstrapping. Our new algorithms operate within the realm of prime-power and odd composite cyclotomic rings, offering versatility without any additional requirements on input noise and message space beyond correct decryption.",
author = "Han Xia and Liu, \{Feng Hao\} and Han Wang",
note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2025.; 22nd Theory of Cryptography Conference, TCC 2024 ; Conference date: 02-12-2024 Through 06-12-2024",
year = "2024",
month = dec,
day = "3",
doi = "10.1007/978-3-031-78023-3\_5",
language = "English",
isbn = "9783031780226",
series = "Lecture Notes in Computer Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "130--163",
editor = "Elette Boyle and Elette Boyle and Mohammad Mahmoody",
booktitle = "Theory of Cryptography - 22nd International Conference, TCC 2024, Proceedings",
}