A lower bound for proving hardness of learning with rounding with polynomial modulus

DOI10.1007/978-3-031-38554-4_26OpenAlexW4385654644MaRDI QIDQ6190159

Silas Richelson, Parker Newton

Publication date: 6 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38554-4_26

zbMATH Keywords

lower boundslattice problemslearning with errorslearning with rounding

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Cryptography (94A60)

Cites Work

• Unnamed Item
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On the Hardness of Learning with Rounding over Small Modulus
• Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
• (Leveled) fully homomorphic encryption without bootstrapping
• Learning with Rounding, Revisited
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Extracting Randomness from Multiple Independent Sources
• Trapdoors for hard lattices and new cryptographic constructions
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Public-key cryptosystems from the worst-case shortest vector problem
• Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: A lower bound for proving hardness of learning with rounding with polynomial modulus