Spherical Gaussian leftover hash lemma via the Rényi divergence

DOI10.1007/978-3-031-33488-7_26zbMATH Open1542.94136MaRDI QIDQ6535100FDOQ6535100

Authors: Hiroki Okada, Kazuhide Fukushima, Shinsaku Kiyomoto, Tsuyoshi Takagi

Publication date: 9 November 2023

Recommendations

Discrete Gaussian leftover hash lemma over infinite domains
Towards a ring analogue of the leftover hash lemma
Sharper bounds in lattice-based cryptography using the Rényi divergence
Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
Hardness of LWE on general entropic distributions

lattice LWE leftover hash lemma discrete Gaussian

Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

TFHE: fast fully homomorphic encryption over the torus
Matrix Analysis
Title not available (Why is that?)
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Fully homomorphic encryption from ring-LWE and security for key dependent messages
Title not available (Why is that?)
Functional encryption for inner product predicates from learning with errors
Trapdoors for hard lattices and new cryptographic constructions
A Pseudorandom Generator from any One-way Function
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
(Leveled) fully homomorphic encryption without bootstrapping
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval
On lattices, learning with errors, random linear codes, and cryptography
Rényi Divergence and Kullback-Leibler Divergence
Trapdoors for lattices: simpler, tighter, faster, smaller
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
Advances in Cryptology - EUROCRYPT 2004
Note on best possible bounds for determinants of matrices close to the identity matrix
Title not available (Why is that?)
Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
Candidate Multilinear Maps from Ideal Lattices
An efficient and parallel Gaussian sampler for lattices
On the asymptotic complexity of solving LWE
Approximate trapdoors for lattices and smaller hash-and-sign signatures
FHEW: bootstrapping homomorphic encryption in less than a second
Homomorphic encryption for arithmetic of approximate numbers
GGHLite: more efficient multilinear maps from ideal lattices
Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
Gaussian sampling over the integers: efficient, generic, constant-time
Sharper bounds in lattice-based cryptography using the Rényi divergence
Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
Discrete Gaussian leftover hash lemma over infinite domains
A note on discrete Gaussian combinations of lattice vectors
On the hardness of learning with rounding over small modulus
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
Integral matrix Gram root and lattice Gaussian sampling without floats
Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
On the hardness of the NTRU problem
On the smoothing parameter and last minimum of random orthogonal lattices
On the hardness of module learning with errors with short distributions
Round-optimal lattice-based threshold signatures, revisited

This page was built for publication: Spherical Gaussian leftover hash lemma via the Rényi divergence

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