Pages that link to "Item:Q2796126"

The following pages link to On the Hardness of Learning with Rounding over Small Modulus (Q2796126):

Displaying 16 items.

• 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)
• Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
• On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
• Rounding in the rings (Q2096527) (← links)
• Hardness of LWE on general entropic distributions (Q2119024) (← links)
• Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
• Computational fuzzy extractors (Q2216116) (← links)
• Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
• Approximate-Deterministic Public Key Encryption from Hard Learning Problems (Q3179474) (← links)
• Compact Hierarchical IBE from Lattices in the Standard Model (Q3297499) (← links)
• Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption (Q3297610) (← links)
• Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
• Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange (Q5041164) (← links)
• Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173) (← links)
• Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)