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

DOI10.1007/978-3-662-48797-6_1MaRDI QIDQ2811123zbMATHOpenAlexFDO

Authors Shi Bai, Adeline Roux-Langlois, Tancrède Lepoint, Damien Stehlé, 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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(28)

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

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)