Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
From MaRDI portal
Publication:6157567
DOI10.1007/978-3-030-92078-4_23zbMath1514.94065OpenAlexW3176410512MaRDI QIDQ6157567
Ilaria Chillotti, Damien Ligier, Samuel Tap, Jean-Baptiste Orfila
Publication date: 12 May 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-030-92078-4_23
Related Items (8)
Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Discretization error reduction for high precision torus fully homomorphic encryption ⋮ Optimisations and tradeoffs for HElib ⋮ Parameter optimization and larger precision for (T)FHE ⋮ Batched fully homomorphic encryption from TFHE ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher ⋮ \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
Cites Work
- Homomorphic lower digits removal and improved FHE bootstrapping
- CHIMERA: combining ring-LWE-based fully homomorphic encryption 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
- Homomorphic encryption for arithmetic of approximate numbers
- Fully homomorphic SIMD operations
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- 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
This page was built for publication: Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
