Learning with Rounding, Revisited
From MaRDI portal
Publication:2845660
DOI10.1007/978-3-642-40041-4_4zbMath1310.94123OpenAlexW38127577MaRDI QIDQ2845660
Daniel Wichs, Krzysztof Pietrzak, Joël Alwen, Stephan Krenn
Publication date: 2 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_4
Related Items (45)
Witness Maps and Applications ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Adaptively secure distributed PRFs from LWE ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Classical Verification of Quantum Computations ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Logarithmic-size (linkable) threshold ring signatures in the plain model ⋮ Computational fuzzy extractor from LWE ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ How to build a trapdoor function from an encryption scheme ⋮ Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Lattice-based authenticated key exchange with tight security ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ A lower bound for proving hardness of learning with rounding with polynomial modulus ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Lattice-based e-cash, revisited ⋮ Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption ⋮ Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting ⋮ NTRU prime: reducing attack surface at low cost ⋮ Pseudorandom functions in NC class from the standard LWE assumption ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Hardness of entropic module-LWE ⋮ On the Hardness of Learning with Rounding over Small Modulus ⋮ Watermarking PRFs and PKE against quantum adversaries ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Tighter security for generic authenticated key exchange in the QROM ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits ⋮ Ring/module learning with errors under linear leakage -- hardness and applications ⋮ Compact selective opening security from LWE ⋮ Fast public-key silent OT and more from constrained Naor-Reingold ⋮ Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems ⋮ CCA-security from adaptive all-but-one lossy trapdoor functions ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems ⋮ Incompressible encodings ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Rounding in the rings ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm ⋮ Pseudorandom Functions: Three Decades Later ⋮ Hardness of LWE on general entropic distributions ⋮ Key-homomorphic pseudorandom functions from LWE with small modulus
This page was built for publication: Learning with Rounding, Revisited
