Fully Homomorphic Encryption with Polylog Overhead
From MaRDI portal
Publication:2894424
DOI10.1007/978-3-642-29011-4_28zbMath1297.94071OpenAlexW1755636270MaRDI QIDQ2894424
Shai Halevi, Craig Gentry, Nigel P. Smart
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_28
Related Items (42)
On the deductive security of queries to confidential databases in cloud computing systems ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Provably Weak Instances of Ring-LWE ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Asymptotically quasi-optimal cryptography ⋮ Field instruction multiple data ⋮ Bootstrapping for helib ⋮ Efficient Computations over Encrypted Data Blocks ⋮ Depth Optimized Efficient Homomorphic Sorting ⋮ FHEW with Efficient Multibit Bootstrapping ⋮ On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes ⋮ Optimisations and tradeoffs for HElib ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes ⋮ Homomorphic encryption: a mathematical survey ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Revisiting homomorphic encryption schemes for finite fields ⋮ Efficient circuits for permuting and mapping packed values across leveled homomorphic ciphertexts ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Bootstrapping for BGV and BFV revisited ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Fully homomorphic SIMD operations ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES ⋮ Cryptanalysis of a homomorphic encryption scheme ⋮ CRT-based fully homomorphic encryption over the integers ⋮ Packed Ciphertexts in LWE-Based Homomorphic Encryption ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Some security bounds for the key sizes of DGHV scheme ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ On the deductive security of queries to databases with multi-bit records ⋮ Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption ⋮ Bootstrapping fully homomorphic encryption over the integers in less than one second ⋮ Homomorphic Encryption ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
This page was built for publication: Fully Homomorphic Encryption with Polylog Overhead
