FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption
Computation on ciphertexts of all known fully homomorphic encryption (FHE) schemes induces some noise, which, if too large, will destroy the plaintext. Therefore, the bootstrapping technique that re-encrypts a ciphertext and reduces the noise level remains the only known way of building FHE schemes...
Main Authors: | Kamil Kluczniak, Leonard Schild |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2022-11-01
|
Series: | Transactions on Cryptographic Hardware and Embedded Systems |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/9960 |
Similar Items
-
Practical solutions in fully homomorphic encryption: a survey analyzing existing acceleration methods
by: Yanwei Gong, et al.
Published: (2024-03-01) -
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
by: Marc Joye
Published: (2022-08-01) -
SoK: Fully Homomorphic Encryption over the [Discretized] Torus
by: Marc Joye
Published: (2022-08-01) -
Fast and Accurate: Efficient Full-Domain Functional Bootstrap and Digit Decomposition for Homomorphic Computation
by: Shihe Ma, et al.
Published: (2023-12-01) -
Analysis of Modified Shell Sort for Fully Homomorphic Encryption
by: Joon-Woo Lee, et al.
Published: (2021-01-01)