Large-Plaintext Functional Bootstrapping in FHE with Small Bootstrapping Keys
Dengfa Liu, Hongbo Li

TL;DR
This paper introduces a novel polynomial vector encoding for look-up tables in FHE, significantly reducing bootstrapping key sizes and improving efficiency for large plaintexts.
Contribution
It proposes a new polynomial vector encoding method for look-up tables, enabling smaller bootstrapping keys and faster homomorphic evaluation in FHE schemes.
Findings
Reduced bootstrapping key size by polynomial factor
Improved run-time efficiency in homomorphic operations
Enhanced scalability for large plaintexts
Abstract
Functional bootstrapping is a core technique in Fully Homomorphic Encryption (FHE). For large plaintext, to evaluate a general function homomorphically over a ciphertext, in the FHEW/TFHE approach, since the function in look-up table form is encoded in the coefficients of a test polynomial, the degree of the polynomial must be high enough to hold the entire table. This increases the bootstrapping time complexity and memory cost, as the size of bootstrapping keys and keyswitching keys need to be large accordingly. In this paper, we propose to encode the look-up table of any function in a polynomial vector, whose coefficients can hold more data. The corresponding representation of the additive group Zq used in the RGSW-based bootstrapping is the group of monic monomial permutation matrices, which integrates the permutation matrix representation used by Alperin-Sheriff and Peikert in 2014,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptographic Implementations and Security · Cryptography and Data Security
