Pages that link to "Item:Q2811123"
From MaRDI portal
The following pages link to Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance (Q2811123):
Displaying 13 items.
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Rounding in the rings (Q2096527) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- Lattice trapdoors and IBE from middle-product LWE (Q2175903) (← links)
- More efficient construction of anonymous signatures (Q2673068) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784) (← links)
- The GGM Function Family Is a Weakly One-Way Family of Functions (Q3179353) (← links)
