Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance

DOI10.1007/978-3-662-48797-6_1zbMATH Open1337.94021OpenAlexW2261941747MaRDI QIDQ2811123FDOQ2811123

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

Recommendations

• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
• Sharper bounds in lattice-based cryptography using the Rényi divergence
• Improved security evaluation techniques for imperfect randomness from arbitrary distributions
• Cryptographic divergences: new techniques and new applications

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (25)

• Cryptographic divergences: new techniques and new applications
• Isochronous Gaussian Sampling: From Inception to Implementation
• Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Bit security as computational cost for winning games with high probability
• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
• NEV: faster and smaller NTRU encryption using vector decoding
• Efficient lattice-based blind signatures via Gaussian one-time signatures
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Towards classical hardness of module-LWE: the linear rank case
• Secure Implementation of Lattice-Based Encryption Schemes
• On the Hardness of Learning with Rounding over Small Modulus
• A lower bound for proving hardness of learning with rounding with polynomial modulus
• On the bit security of cryptographic primitives
• Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More
• Integral matrix Gram root and lattice Gaussian sampling without floats
• Lattice trapdoors and IBE from middle-product LWE
• More efficient construction of anonymous signatures
• Ring signatures for deniable AKEM: Gandalf's fellowship
• The GGM Function Family Is a Weakly One-Way Family of Functions
• Hardness of \(k\)-LWE and applications in traitor tracing
• Replacing Probability Distributions in Security Games via Hellinger Distance
• COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
• Rounding in the rings

This page was built for publication: Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811123)