Packed Ciphertexts in LWE-Based Homomorphic Encryption
From MaRDI portal
Publication:4915997
DOI10.1007/978-3-642-36362-7_1zbMath1314.94058OpenAlexW1874619058MaRDI QIDQ4915997
Zvika Brakerski, Shai Halevi, Craig Gentry
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_1
Related Items (17)
Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Compressible FHE with applications to PIR ⋮ FHEW with Efficient Multibit Bootstrapping ⋮ Batched fully homomorphic encryption from TFHE ⋮ How to compress encrypted data ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ The direction of updatable encryption does matter ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ Cryptanalysis of a homomorphic encryption scheme ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Provably Secure (Broadcast) Homomorphic Signcryption ⋮ Privacy-preserving polynomial interpolation and its applications on predictive analysis
Cites Work
- Unnamed Item
- Fully homomorphic SIMD operations
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Homomorphic Encryption with Polylog Overhead
- Ring Switching in BGV-Style Homomorphic Encryption
- Homomorphic Evaluation of the AES Circuit
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Homomorphic Encryption: From Private-Key to Public-Key
- Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster)
- The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Ideal Lattices and Learning with Errors over Rings
- A Framework for Efficient and Composable Oblivious Transfer
- Markov Ciphers and Differential Cryptanalysis
- Higher Order Derivatives and Differential Cryptanalysis
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Packed Ciphertexts in LWE-Based Homomorphic Encryption
