Discrete Gaussian Leftover Hash Lemma over Infinite Domains

DOI10.1007/978-3-642-42033-7_6zbMath1320.94059OpenAlexW101016172MaRDI QIDQ2867213

Craig Gentry, Shweta Agrawal, Amit Sahai, Shai Halevi

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42033-7_6

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ On the smoothing parameter and last minimum of random orthogonal lattices ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ On a certain class of positive definite functions and measures on locally compact abelian groups and inner-product spaces ⋮ On the complexity of the BKW algorithm on LWE ⋮ FHE Circuit Privacy Almost for Free ⋮ A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem

This page was built for publication: Discrete Gaussian Leftover Hash Lemma over Infinite Domains