Homomorphic Encryption Standard
DOI10.1007/978-3-030-77287-1_2zbMATH Open1502.94026OpenAlexW4205350912MaRDI QIDQ5044564FDOQ5044564
Authors: Martin R. Albrecht, Melissa Chase, Hao Chen, Sergey Gorbunov, Shai Halevi, Jeff Hoffstein, Kim Laine, Satya Lokam, Daniele Micciancio, Dustin Moody, Travis Morrison, Amit Sahai, Vinod Vaikuntanathan, Jintai Ding, Kristin Lauter, Shafi Goldwasser 
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
Cites Work
- BKZ 2.0: Better lattice security estimates
- Title not available (Why is that?)
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- New Algorithms for Learning in Presence of Errors
- (Leveled) fully homomorphic encryption without bootstrapping
- Better key sizes (and attacks) for LWE-based encryption
- Lattice-based Cryptography
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- On Lovász' lattice reduction and the nearest lattice point problem
- On ideal lattices and learning with errors over rings
- Solving the shortest vector problem in lattices faster using quantum search
- New directions in nearest neighbor searching with applications to lattice sieving
- Sampling exactly from the normal distribution
- A toolkit for ring-LWE cryptography
- On the concrete hardness of learning with errors
- How (not) to instantiate ring-LWE
- FHEW: bootstrapping homomorphic encryption in less than a second
- Provably weak instances of ring-LWE revisited
- Faster Bootstrapping with Polynomial Error
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- On error distributions in ring-based LWE
- Provably weak instances of Ring-LWE
- Attacks on the Search RLWE Problem with Small Errors
- Revisiting the expected cost of solving uSVP and applications to LWE
- On the efficacy of solving LWE by reduction to unique-SVP
- Solving BDD by enumeration: an update
- Security considerations for Galois non-dual RLWE families
- Which ring based somewhat homomorphic encryption scheme is best?
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
Cited In (7)
- TFHE: fast fully homomorphic encryption over the torus
- Formalization of the data encryption standard
- Unification modulo homomorphic encryption
- 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
Uses Software
This page was built for publication: Homomorphic Encryption Standard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044564)
