Efficient Fully Homomorphic Encryption from (Standard) LWE
From MaRDI portal
Publication:5495009
DOI10.1109/FOCS.2011.12zbMath1292.94038MaRDI QIDQ5495009
Zvika Brakerski, Vinod Vaikuntanathan
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ Blending FHE-NTRU Keys – The Excalibur Property ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ On the Efficacy of Solving LWE by Reduction to Unique-SVP ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ Privacy-preserving blueprints ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Algebraic restriction codes and their applications ⋮ Solving LWR via BDD Strategy: Modulus Switching Approach ⋮ Multi-key Homomorphic Proxy Re-Encryption ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Batched fully homomorphic encryption from TFHE ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ FINAL: faster FHE instantiated with NTRU and LWE ⋮ Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Post-quantum insecurity from LWE ⋮ Quantum search-to-decision reduction for the LWE problem ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Cryptography with certified deletion ⋮ Error correction and ciphertext quantization in lattice cryptography ⋮ Private AI: Machine Learning on Encrypted Data ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Lattice-Based Identity-Based Homomorphic Conditional Proxy Re-Encryption for Secure Big Data Computing in Cloud Environment ⋮ Unnamed Item ⋮ Deterministic compression with uncertain priors ⋮ Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications ⋮ Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements ⋮ Sequential decision making with vector outcomes ⋮ Learning mixtures of arbitrary distributions over large discrete domains ⋮ Why do simple algorithms for triangle enumeration work in the real world? ⋮ Black-box obfuscation for d-CNFs ⋮ Candidate weak pseudorandom functions in AC 0 ○ MOD 2 ⋮ Iterated group products and leakage resilience against NC1 ⋮ Building one-time memories from isolated qubits ⋮ Attribute-efficient evolvability of linear functions ⋮ Energy-efficient circuit design ⋮ Rate-independent computation in continuous chemical reaction networks ⋮ Testers and their applications ⋮ On the automorphism groups of strongly regular graphs I ⋮ Faster private release of marginals on small databases ⋮ Mechanism design in large games ⋮ Redrawing the boundaries on purchasing data from privacy-sensitive individuals ⋮ Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems ⋮ Complexity of approximating CSP with balance / hard constraints ⋮ Integer feasibility of random polytopes ⋮ Multireference alignment using semidefinite programming ⋮ Partial tests, universal tests and decomposability ⋮ High dimensional expanders and property testing ⋮ Parameterized testability ⋮ Direct sum fails for zero error average communication ⋮ Rational arguments ⋮ Boolean Functions for Homomorphic-Friendly Stream Ciphers ⋮ Fractional LWE: A Nonlinear Variant of LWE ⋮ Packed Ciphertexts in LWE-Based Homomorphic Encryption ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES ⋮ Chosen-Ciphertext Secure Fully Homomorphic Encryption ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Separating IND-CPA and Circular Security for Unbounded Length Key Cycles ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ The truth behind the myth of the folk theorem ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ Unnamed Item ⋮ Limits of local algorithms over sparse random graphs ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Improved learning of \(k\)-parities ⋮ Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ The Complexity of Public-Key Cryptography ⋮ Some Open Problems in Information-Theoretic Cryptography ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Round efficient secure multiparty quantum computation with identifiable abort ⋮ Lattice-based key exchange on small integer solution problem ⋮ On the deductive security of queries to confidential databases in cloud computing systems ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Large message homomorphic secret sharing from DCR and applications ⋮ Polly cracker, revisited ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Lattice-based certificateless encryption scheme ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ Transciphering, using FiLIP and TFHE for an efficient delegation of computation ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Practical private-key fully homomorphic encryption in rings ⋮ Homomorphic \(\mathrm {SIM}^2\)D operations: single instruction much more data ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ Garbled circuits with sublinear evaluator ⋮ Asymptotically quasi-optimal cryptography ⋮ Batch-OT with optimal rate ⋮ Quantum algorithms for variants of average-case lattice problems via filtering
This page was built for publication: Efficient Fully Homomorphic Encryption from (Standard) LWE
