Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
type: Item
instance of: scholarly article
title: Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
zbMATH Open document ID: 1444.94043
author: Shi Bai
author: Tancrède Lepoint
author: Adeline Roux-Langlois
author: Amin Sakzad
author: Damien Stehlé
author: Ron Steinfeld
published in: Journal of Cryptology
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 62B10
Mathematics Subject Classification ID: 60E15
Mathematics Subject Classification ID: 94A17
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6875425
zbMATH Keywords: lattice-based cryptography
zbMATH Keywords: Rényi divergence
zbMATH Keywords: statistical distance
zbMATH Keywords: security proofs
describes a project that uses: BLISS
MaRDI profile type: Publication
full work available at URL: s00145-017-9265-9
OpenAlex ID: W2747375172
Wikidata QID: Q113906166
cites work: Q4228459
cites work: Learning with Rounding, Revisited
cites work: On the Hardness of Learning with Rounding over Small Modulus
cites work: Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
cites work: Classical hardness of learning with errors
cites work: Pseudorandom Functions and Lattices
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Lattice Signatures and Bimodal Gaussians
cites work: Lossy Codes and a New Variant of the Learning-With-Errors Problem
cites work: Candidate Multilinear Maps from Ideal Lattices
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Hardness of k-LWE and Applications in Traitor Tracing
cites work: GGHLite: More Efficient Multilinear Maps from Ideal Lattices
cites work: Lattice Signatures without Trapdoors
cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
cites work: Hardness of SIS and LWE with Small Parameters
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Lattice-based Cryptography
cites work: Enhanced Lattice-Based Signatures on Reconfigurable Hardware
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: A decade of lattice cryptography
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Q3292859
cites work: Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders
cites work: Rényi Divergence and Kullback-Leibler Divergence
DOI: 10.1007/S00145-017-9265-9
description: scientific article; zbMATH DE number 6875425