Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
From MaRDI portal
Publication:2161427
DOI10.1007/s10623-022-01083-7zbMath1495.94045OpenAlexW4285091843WikidataQ114849691 ScholiaQ114849691MaRDI QIDQ2161427
Ron Steinfeld, Katharina Boudgoust, Amin Sakzad
Publication date: 4 August 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01083-7
Related Items
Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem, \textsf{Orbweaver}: succinct linear functional commitments from lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
- Estimate all the {LWE, NTRU} schemes!
- Coding theory: the unit-derived methodology
- On the ideal shortest vector problem over random rational primes
- LWE with side information: attacks and concrete security estimation
- Approx-SVP in ideal lattices with pre-processing
- A Decade of Lattice Cryptography
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Lattice-based Cryptography
- Efficient Public Key Encryption Based on Ideal Lattices
- Practical Signatures from the Partial Fourier Recovery Problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- On Ideal Lattices and Learning with Errors over Rings
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Short Stickelberger Class Relations and Application to Ideal-SVP
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Introduction to Coding Theory
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- NTRU Fatigue: How Stretched is Overstretched?
