Batched fully homomorphic encryption from TFHE
From MaRDI portal
Publication:6111985
DOI10.1007/978-3-031-22390-7_7zbMath1530.94034OpenAlexW4312964840MaRDI QIDQ6111985
Publication date: 4 August 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-22390-7_7
Cites Work
- Bootstrapping fully homomorphic encryption with ring plaintexts within polynomial noise
- Batched multi-hop multi-key FHE from ring-LWE with compact ciphertext extension
- Polynomial algorithms in computer algebra
- Efficient homomorphic conversion between (ring) LWE ciphertexts
- Multi-key homomorphic encryption from TFHE
- TFHE: fast fully homomorphic encryption over the torus
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- 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
- Packing Messages and Optimizing Bootstrapping in GSW-FHE
- FHEW with Efficient Multibit Bootstrapping
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Ring Packing and Amortized FHEW Bootstrapping
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- The Fast Fourier Transform in a Finite Field
- On lattices, learning with errors, random linear codes, and cryptography
- Improved programmable bootstrapping with larger precision and efficient arithmetic circuits for TFHE
This page was built for publication: Batched fully homomorphic encryption from TFHE
