Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
From MaRDI portal
Publication:2811123
DOI10.1007/978-3-662-48797-6_1zbMath1337.94021OpenAlexW2261941747MaRDI QIDQ2811123
Tancrède Lepoint, Damien Stehlé, Adeline Roux-Langlois, Shi Bai, Ron Steinfeld
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_1
Related Items (21)
Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Isochronous Gaussian Sampling: From Inception to Implementation ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ The GGM Function Family Is a Weakly One-Way Family of Functions ⋮ On the bit security of cryptographic primitives ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Lattice trapdoors and IBE from middle-product LWE ⋮ More efficient construction of anonymous signatures ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ Bit security as computational cost for winning games with high probability ⋮ Secure Implementation of Lattice-Based Encryption Schemes ⋮ A lower bound for proving hardness of learning with rounding with polynomial modulus ⋮ Towards classical hardness of module-LWE: the linear rank case ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ On the Hardness of Learning with Rounding over Small Modulus ⋮ Rounding in the rings ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats
This page was built for publication: Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
