Efficient homomorphic conversion between (ring) LWE ciphertexts
From MaRDI portal
Publication:2117044
DOI10.1007/978-3-030-78372-3_18zbMATH Open1491.94042OpenAlexW3003331030MaRDI QIDQ2117044FDOQ2117044
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78372-3_18
Recommendations
- Efficient fully homomorphic encryption from (standard) LWE
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- (Leveled) fully homomorphic encryption without bootstrapping
- TFHE: fast fully homomorphic encryption over the torus
- A novel fully homomorphic encryption scheme bsed on LWE
Cites Work
- TFHE: fast fully homomorphic encryption over the torus
- Better Bootstrapping in Fully Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Bootstrapping for HElib
- On Ideal Lattices and Learning with Errors over Rings
- (Leveled) fully homomorphic encryption without bootstrapping
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Fully homomorphic SIMD operations
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Worst-case to average-case reductions for module lattices
- ASYMPTOTIC PROPERTIES OF THE MAXIMUM LIKELIHOOD ESTIMATOR FOR STOCHASTIC PARABOLIC EQUATIONS WITH ADDITIVE FRACTIONAL BROWNIAN MOTION
- Ciphers for MPC and FHE
- A full RNS variant of approximate homomorphic encryption
- On the concrete hardness of learning with errors
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- An improved RNS variant of the BFV homomorphic encryption scheme
- Homomorphic encryption for arithmetic of approximate numbers
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- Bootstrapping for approximate homomorphic encryption
- Homomorphic lower digits removal and improved FHE bootstrapping
- Algorithms in HElib
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Compressible FHE with applications to PIR
- Ring Packing and Amortized FHEW Bootstrapping
Cited In (9)
- Transciphering framework for approximate homomorphic encryption
- Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus
- HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Circuit bootstrapping: faster and smaller
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Batched fully homomorphic encryption from TFHE
- Revisiting key switching techniques with applications to light-key FHE
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
Uses Software
This page was built for publication: Efficient homomorphic conversion between (ring) LWE ciphertexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117044)
