The following pages link to Learning with Rounding, Revisited (Q2845660):
Displaying 35 items.
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- CCA-security from adaptive all-but-one lossy trapdoor functions (Q2049981) (← links)
- Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks (Q2061928) (← links)
- Incompressible encodings (Q2096497) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Rounding in the rings (Q2096527) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
- Computational fuzzy extractor from LWE (Q2682915) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
- Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes (Q2817869) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- Approximate-Deterministic Public Key Encryption from Hard Learning Problems (Q3179474) (← links)
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption (Q3297610) (← links)
- Tighter Security Proofs for Post-quantum Key Encapsulation Mechanism in the Multi-challenge Setting (Q3297618) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Witness Maps and Applications (Q5041158) (← links)
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173) (← links)
- Classical Verification of Quantum Computations (Q5096105) (← links)
- Tighter security proofs for GPV-IBE in the quantum random oracle model (Q5925501) (← links)
- Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)
- Hardness of entropic module-LWE (Q6496885) (← links)
- Watermarking PRFs and PKE against quantum adversaries (Q6536747) (← links)
- Tighter security for generic authenticated key exchange in the QROM (Q6604883) (← links)
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits (Q6620040) (← links)
- Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)
- Compact selective opening security from LWE (Q6635895) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
