Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
From MaRDI portal
Publication:1753174
DOI10.1007/s00145-017-9265-9zbMath1444.94043OpenAlexW2747375172WikidataQ113906166 ScholiaQ113906166MaRDI QIDQ1753174
Shi Bai, Tancrède Lepoint, Amin Sakzad, Ron Steinfeld, Adeline Roux-Langlois, Damien Stehlé
Publication date: 28 May 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-017-9265-9
Inequalities; stochastic orderings (60E15) Cryptography (94A60) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10) Combinatorial codes (94B25)
Related Items
A constant-time sampling algorithm for binary Gaussian distribution over the integers ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ On the hardness of module learning with errors with short distributions ⋮ On rejection sampling in Lyubashevsky's signature scheme ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling ⋮ Computational fuzzy extractors ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ On the security of homomorphic encryption on approximate numbers ⋮ On the integer polynomial learning with errors problem ⋮ On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the Hardness of Learning with Rounding over Small Modulus
- A Decade of Lattice Cryptography
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- Hardness of SIS and LWE with Small Parameters
- Lattice Signatures and Bimodal Gaussians
- Learning with Rounding, Revisited
- Hardness of k-LWE and Applications in Traitor Tracing
- Pseudorandom Functions and Lattices
- Lattice Signatures without Trapdoors
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Rényi Divergence and Kullback-Leibler Divergence
- Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice-based Cryptography
- Candidate Multilinear Maps from Ideal Lattices
- Lossy Codes and a New Variant of the Learning-With-Errors Problem
- Public-key cryptosystems from the worst-case shortest vector problem
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware
- Probability Inequalities for Sums of Bounded Random Variables
- On Ideal Lattices and Learning with Errors over Rings
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
