On the hardness of learning with rounding over small modulus
From MaRDI portal
Recommendations
Cites work
- Average Case Complete Problems
- Bi-deniable public-key encryption
- Classical hardness of learning with errors
- GGHLite: more efficient multilinear maps from ideal lattices
- How to Garble Arithmetic Circuits
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Learning with rounding, revisited. New reduction, properties and applications
- On lattices, learning with errors, random linear codes, and cryptography
- Pseudorandom functions and lattices
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Public-key cryptosystems from the worst-case shortest vector problem
- Public-key encryption schemes with auxiliary inputs
- Rényi Divergence and Kullback-Leibler Divergence
Cited in
(36)- On the hardness of the computational ring-LWR problem and its applications
- A nonstandard variant of learning with rounding with polynomial modulus and unbounded samples
- NTRU prime: reducing attack surface at low cost
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- On the security of homomorphic encryption on approximate numbers
- Rounding in the rings
- Hardness of LWE on general entropic distributions
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Computational fuzzy extractors
- Towards sound fresh re-keying with hard (physical) learning problems
- Learning with rounding, revisited. New reduction, properties and applications
- Approximate-deterministic public key encryption from hard learning problems
- Compact hierarchical IBE from lattices in the standard model
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Pseudorandom functions: three decades later
- Limits on the efficiency of (ring) LWE based non-interactive key exchange
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- On homomorphic secret sharing from polynomial-modulus LWE
- Solving LWR via BDD Strategy: Modulus Switching Approach
- Bit security as computational cost for winning games with high probability
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding
- A lower bound for proving hardness of learning with rounding with polynomial modulus
- Hardness of (M)LWE with semi-uniform seeds
- Spherical Gaussian leftover hash lemma via the Rényi divergence
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
- Algebraic equipage for learning with errors in cyclic division algebras
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Compact encryption based on Module-NTRU problems
- Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
- Pseudorandom correlation functions from Ring-LWR
- Simple watermarking pseudorandom functions from extractable pseudorandom generators
- Learning with errors with output dependencies: LWE, LWR, and physical learning problems under the same umbrella
This page was built for publication: On the hardness of learning with rounding over small modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796126)
