Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
From MaRDI portal
Publication:5494940
DOI10.1137/120868669zbMath1302.94037OpenAlexW1979120705WikidataQ121632039 ScholiaQ121632039MaRDI QIDQ5494940
Vinod Vaikuntanathan, Zvika Brakerski
Publication date: 30 July 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120868669
cryptologypublic-key encryptionfully homomorphic encryptionprivate information retrievallearning with errors
Related Items (61)
Identity-based re-encryption scheme with lightweight re-encryption key generation ⋮ On the hardness of module-LWE with binary secret ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ Fine-grained secure computation ⋮ Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption ⋮ An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices ⋮ Survey of information security ⋮ Homomorphic lower digits removal and improved FHE bootstrapping ⋮ High-precision bootstrapping for approximate homomorphic encryption by error variance minimization ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Compressible FHE with applications to PIR ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Sample-size-reduction of quantum states for the noisy linear problem ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Computational fuzzy extractor from LWE ⋮ Homomorphic encryption: a mathematical survey ⋮ EvalRound algorithm in CKKS bootstrapping ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Differentially private naive Bayes learning over multiple data sources ⋮ Balanced non-adjacent forms ⋮ A survey on single server private information retrieval in a coding theory perspective ⋮ A multi-valued quantum fully homomorphic encryption scheme ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ The direction of updatable encryption does matter ⋮ Security considerations for Galois non-dual RLWE families ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ Towards classical hardness of module-LWE: the linear rank case ⋮ An efficient quantum somewhat homomorphic symmetric searchable encryption ⋮ Reduced memory meet-in-the-middle attack against the NTRU private key ⋮ Foundations of Homomorphic Secret Sharing ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Trusted computing with addition machines. I ⋮ How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields ⋮ A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Verifying quantum computations at scale: A cryptographic leash on quantum devices ⋮ Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ On the security of homomorphic encryption on approximate numbers ⋮ A novel fully homomorphic encryption scheme bsed on LWE ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ How to Prove Knowledge of Small Secrets ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ An optimized GHV-type HE scheme: simpler, faster, and more versatile ⋮ Unnamed Item ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence ⋮ Homomorphic Encryption ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
This page was built for publication: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
