Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
From MaRDI portal
Publication:6157567
DOI10.1007/978-3-030-92078-4_23zbMATH Open1514.94065OpenAlexW3176410512MaRDI QIDQ6157567FDOQ6157567
Authors: Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap 
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
Recommendations
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Parameter optimization and larger precision for (T)FHE
- TFHE: fast fully homomorphic encryption over the torus
- Integerwise Functional Bootstrapping on TFHE
- FHEW: bootstrapping homomorphic encryption in less than a second
Cites Work
- TFHE: fast fully homomorphic encryption over the torus
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Bootstrapping for HElib
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
- Efficient public key encryption based on ideal lattices (extended abstract)
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully homomorphic SIMD operations
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- FHEW: bootstrapping homomorphic encryption in less than a second
- Homomorphic encryption for arithmetic of approximate numbers
- Homomorphic lower digits removal and improved FHE bootstrapping
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- 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
Cited In (17)
- Towards case-optimized hybrid homomorphic encryption. Featuring the \textsf{Elisabeth} stream cipher
- Full domain functional bootstrapping with least significant bit encoding
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Discretization error reduction for high precision torus fully homomorphic encryption
- Differential privacy for free? Harnessing the noise in approximate homomorphic encryption
- Circuit bootstrapping: faster and smaller
- Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Optimisations and tradeoffs for HElib
- Parameter optimization and larger precision for (T)FHE
- New techniques for multi-value input homomorphic evaluation and applications
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Batched fully homomorphic encryption from TFHE
- Integerwise Functional Bootstrapping on TFHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
This page was built for publication: Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157567)
