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 QIDQ2811123zbMATH OpenOpenAlexFDO

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

(35)

• On the bit security of cryptographic primitives
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Hardness of \(k\)-LWE and applications in traitor tracing
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Rounding in the rings
• Cryptographic divergences: new techniques and new applications
• Integral matrix Gram root and lattice Gaussian sampling without floats
• Lattice trapdoors and IBE from middle-product LWE
• Improved security evaluation techniques for imperfect randomness from arbitrary distributions
• Sharper bounds in lattice-based cryptography using the Rényi divergence
• More efficient construction of anonymous signatures
• Towards classical hardness of module-LWE: the linear rank case
• On the hardness of learning with rounding over small modulus
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Towards tightly secure lattice short signature and id-based encryption
• The GGM Function Family Is a Weakly One-Way Family of Functions
• Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
• 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
• Replacing Probability Distributions in Security Games via Hellinger Distance
• 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
• NEV: faster and smaller NTRU encryption using vector decoding
• Ring signatures for deniable AKEM: Gandalf's fellowship
• Two-round threshold signature from algebraic one-more learning with errors
• Finally! A compact lattice-based threshold signature
• Strongly secure universal thresholdizer
• Module learning with errors with truncated matrices
• Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
• Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
• IND-CPA-D and KR-D security with reduced noise from the HintLWE problem

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)