On the integer polynomial learning with errors problem
From MaRDI portal
Publication:2061918
DOI10.1007/978-3-030-75245-3_8zbMath1479.94155OpenAlexW3164095070MaRDI QIDQ2061918
Damien Stehlé, Amin Sakzad, Ron Steinfeld, Julien Devevey
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_8
Cites Work
- Unnamed Item
- A new public-key cryptosystem via Mersenne numbers
- On the ring-LWE and polynomial-LWE problems
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- Advances in cryptology -- ASIACRYPT 2017. 23rd international conference on the theory and applications of cryptology and information security, Hong Kong, China, December 3--7, 2017. Proceedings. Part I
- A modular analysis of the Fujisaki-Okamoto transformation
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- A framework for cryptographic problems from linear algebra
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- Tighter proofs of CCA security in the quantum random oracle model
- Worst-case to average-case reductions for module lattices
- (Leveled) fully homomorphic encryption without bootstrapping
- Pseudorandom Functions and Lattices
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Efficient Public Key Encryption Based on Ideal Lattices
- Pseudorandomness of ring-LWE for any ring and modulus
- Integer Version of Ring-LWE and Its Applications
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
