Lattice-based FHE as secure as PKE
From MaRDI portal
Publication:2988863
DOI10.1145/2554797.2554799zbMath1364.94528OpenAlexW2159486442MaRDI QIDQ2988863
Vinod Vaikuntanathan, Zvika Brakerski
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/90959
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (49)
Constraining and Watermarking PRFs from Milder Assumptions ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ Multi-key FHE from LWE, Revisited ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Transciphering, using FiLIP and TFHE for an efficient delegation of computation ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Compressible FHE with applications to PIR ⋮ Private Computation on Encrypted Genomic Data ⋮ Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Batch bootstrapping. I: A new framework for SIMD bootstrapping in polynomial modulus ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ A note on the post-quantum security of (ring) signatures ⋮ mrNISC from LWE with polynomial modulus ⋮ Computational fuzzy extractor from LWE ⋮ Homomorphic encryption: a mathematical survey ⋮ mrNISC from LWE with polynomial modulus ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ The round complexity of quantum zero-knowledge ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Vector and functional commitments from lattices ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Ring Packing and Amortized FHEW Bootstrapping ⋮ The projection games conjecture and the hardness of approximation of Super-SAT and related problems ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ Candidate iO from homomorphic encryption schemes ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ Candidate iO from homomorphic encryption schemes ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ FHE Circuit Privacy Almost for Free ⋮ Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts ⋮ Keyed-fully homomorphic encryption without indistinguishability obfuscation ⋮ Homomorphic Encryption ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus
Cites Work
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Trapdoors for hard lattices and new cryptographic constructions
- Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
- Evaluating Branching Programs on Encrypted Data
- Bounds for Width Two Branching Programs
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- New lattice-based cryptographic constructions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Lattice-based FHE as secure as PKE
