Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
From MaRDI portal
Publication:5739214
DOI10.1007/978-3-662-49896-5_19zbMath1371.94635OpenAlexW2480841974MaRDI QIDQ5739214
Nicolas Gama, Malika Izabachène, Phong Q. Nguyen, Xiang Xie
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_19
Related Items (10)
Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ⋮ Fast blind rotation for bootstrapping FHEs ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Counting Co-Cyclic Lattices ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
This page was built for publication: Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
