A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem
From MaRDI portal
Publication:2118564
DOI10.1007/978-3-030-81293-5_25zbMath1485.94082OpenAlexW3174027614MaRDI QIDQ2118564
Prastudy Fauzi, Martha Norberg Hovd, Håvard Raddum
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_25
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- Gaussian sampling over the integers: efficient, generic, constant-time
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Discrete Gaussian Leftover Hash Lemma over Infinite Domains
- On CCA-Secure Somewhat Homomorphic Encryption
- On Key Recovery Attacks Against Existing Somewhat Homomorphic Encryption Schemes
- Adaptive Key Recovery Attacks on NTRU-Based Somewhat Homomorphic Encryption Schemes
- Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme
- Improved Generic Algorithms for Hard Knapsacks
- New Generic Algorithms for Hard Knapsacks
- Efficient Lattice (H)IBE in the Standard Model
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
This page was built for publication: A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem