Discretization error reduction for high precision torus fully homomorphic encryption
From MaRDI portal
Publication:6067349
DOI10.1007/978-3-031-31371-4_2zbMath1526.94037OpenAlexW4367593146MaRDI QIDQ6067349
Publication date: 16 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_2
Cites Work
- On the concrete hardness of learning with errors
- Fast homomorphic evaluation of deep discretized neural networks
- Improved secure integer comparison via homomorphic encryption
- Bootstrapping for approximate homomorphic encryption
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes
- High-precision bootstrapping for approximate homomorphic encryption by error variance minimization
- New techniques for multi-value input homomorphic evaluation and applications
- TFHE: fast fully homomorphic encryption over the torus
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- 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
- Fully homomorphic encryption using 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: Discretization error reduction for high precision torus fully homomorphic encryption