Batched fully homomorphic encryption from TFHE
From MaRDI portal
Recommendations
- TFHE: fast fully homomorphic encryption over the torus
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
- FHEW: bootstrapping homomorphic encryption in less than a second
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- FHEW with Efficient Multibit Bootstrapping
- FHEW: bootstrapping homomorphic encryption in less than a second
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully homomorphic SIMD operations
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
- Integerwise Functional Bootstrapping on TFHE
- Multi-key homomorphic encryption from TFHE
- On lattices, learning with errors, random linear codes, and cryptography
- Packed ciphertexts in LWE-based homomorphic encryption
- Packing messages and optimizing bootstrapping in GSW-FHE
- Polynomial algorithms in computer algebra
- Ring packing and amortized FHEW bootstrapping
- TFHE: fast fully homomorphic encryption over the torus
- The Fast Fourier Transform in a Finite Field
Cited in
(5)- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Threshold fully homomorphic encryption over the torus
- Full domain functional bootstrapping with least significant bit encoding
- Amortized functional bootstrapping in less than 7 ms, with \(\widetilde{O}(1)\) polynomial multiplications
This page was built for publication: Batched fully homomorphic encryption from TFHE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6111985)