Ring Packing and Amortized FHEW Bootstrapping
From MaRDI portal
Publication:5002783
DOI10.4230/LIPIcs.ICALP.2018.100zbMath1504.94171OpenAlexW2950842792MaRDI QIDQ5002783
Jessica Sorrell, Daniele Miccianco
Publication date: 28 July 2021
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9104/pdf/LIPIcs-ICALP-2018-100.pdf
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Boolean functions (94D10)
Related Items (8)
Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Batch bootstrapping. II: Bootstrapping in polynomial modulus only requires \(\tilde{O}(1)\) FHE multiplications in amortization ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Batched fully homomorphic encryption from TFHE ⋮ Batched fully dynamic multi-key FHE from FHEW-like cryptosystems ⋮ Fast blind rotation for bootstrapping FHEs ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Efficient homomorphic conversion between (ring) LWE ciphertexts
Uses Software
Cites Work
- Fully homomorphic SIMD operations
- (Leveled) fully homomorphic encryption without bootstrapping
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Improved Short Lattice Signatures in the Standard Model
- Algorithms in HElib
- Fully Homomorphic Encryption with Polylog Overhead
- Better Bootstrapping in Fully Homomorphic Encryption
- Ring Switching in BGV-Style Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW with Efficient Multibit Bootstrapping
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Lattice-based FHE as secure as PKE
- Packed Ciphertexts in LWE-Based Homomorphic Encryption
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Ring Packing and Amortized FHEW Bootstrapping
