Parameter optimization and larger precision for (T)FHE
From MaRDI portal
Publication:6109082
DOI10.1007/s00145-023-09463-5zbMath1518.94045OpenAlexW4380082463MaRDI QIDQ6109082
Anas Boudi, Jean-Baptiste Orfila, Loris Bergerat, Ilaria Chillotti, Damien Ligier, Quentin Bourgerie, Samuel Tap
Publication date: 26 July 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09463-5
Related Items (1)
Cites Work
- On the concrete hardness of learning with errors
- Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits
- Improved secure integer comparison via homomorphic encryption
- A multi-start heuristic for multiplicative depth minimization of Boolean circuits
- New techniques for multi-value input homomorphic evaluation and applications
- TFHE: fast fully homomorphic encryption over the torus
- Homomorphic encryption for arithmetic of approximate numbers
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Public Key Encryption Based on Ideal Lattices
- On lattices, learning with errors, random linear codes, and cryptography
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
This page was built for publication: Parameter optimization and larger precision for (T)FHE
