Homomorphic Encryption Standard
From MaRDI portal
Publication:5044564
DOI10.1007/978-3-030-77287-1_2zbMath1502.94026OpenAlexW4205350912MaRDI QIDQ5044564
Kim Laine, Daniele Micciancio, Dustin Moody, Satya Lokam, Martin R. Albrecht, Hao Chen, Shai Halevi, Jeffrey Hoffstein, Vinod Vaikuntanathan, Travis Morrison, Sergey Gorbunov, Amit Sahai, Melissa Chase, Jintai Ding, Kristin E. Lauter
Publication date: 2 November 2022
Published in: Protecting Privacy through Homomorphic Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-77287-1_2
Related Items (5)
Fast blind rotation for bootstrapping FHEs ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Private AI: Machine Learning on Encrypted Data ⋮ An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption ⋮ TFHE: fast fully homomorphic encryption over the torus
Uses Software
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- On Lovász' lattice reduction and the nearest lattice point problem
- Security considerations for Galois non-dual RLWE families
- Revisiting the expected cost of solving uSVP and applications to LWE
- Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
- Provably Weak Instances of Ring-LWE Revisited
- (Leveled) fully homomorphic encryption without bootstrapping
- How (Not) to Instantiate Ring-LWE
- Sampling Exactly from the Normal Distribution
- Faster Bootstrapping with Polynomial Error
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- On error distributions in ring-based LWE
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- On the Efficacy of Solving LWE by Reduction to Unique-SVP
- Provably Weak Instances of Ring-LWE
- Lattice-based Cryptography
- New directions in nearest neighbor searching with applications to lattice sieving
- Attacks on the Search RLWE Problem with Small Errors
- Solving BDD by Enumeration: An Update
- A Toolkit for Ring-LWE Cryptography
- Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
- On Ideal Lattices and Learning with Errors over Rings
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
This page was built for publication: Homomorphic Encryption Standard
