On the Hardness of Learning with Rounding over Small Modulus

DOI10.1007/978-3-662-49096-9_9zbMath1388.94035OpenAlexW2293813270MaRDI QIDQ2796126

Silas Richelson, Siyao Guo, Daniel Masny, Alon Rosen, Andrej Bogdanov

Publication date: 23 March 2016

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_9

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (21)

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 ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ 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 ⋮ Computational fuzzy extractors ⋮ Compact Hierarchical IBE from Lattices in the Standard Model ⋮ Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption ⋮ 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 ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Rounding in the rings ⋮ Pseudorandom Functions: Three Decades Later ⋮ Hardness of LWE on general entropic distributions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus

Cites Work

• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• Learning with Rounding, Revisited
• Pseudorandom Functions and Lattices
• Rényi Divergence and Kullback-Leibler Divergence
• Public-Key Encryption Schemes with Auxiliary Inputs
• Average Case Complete Problems
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Bi-Deniable Public-Key Encryption
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices
• How to Garble Arithmetic Circuits
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On the Hardness of Learning with Rounding over Small Modulus