Worst-case to average-case reductions based on Gaussian measures

DOI10.1109/FOCS.2004.72MaRDI QIDQ7255268zbMATH OpenFDO

Authors Daniele Micciancio, Oded Regev

Publication date 29 May 2026

Full work available at URL https://doi.org/10.1109/FOCS.2004.72

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(9)

• A closer look at \textsc{Falcon}
• Solving the shortest vector problem in \(2^{0.63269n+o(n)}\) time on random lattices
• A minrank-based encryption scheme à la Alekhnovich-Regev
• Look ahead! Practical CCA-secure steganography: cover-source switching meets lattice Gaussian sampling
• \textsf{ABBA}: lattice-based commitments from commutators
• More efficient lattice-based electronic voting from NTRU
• Learning with errors from nonassociative algebras
• Circuit privacy for FHEW/TFHE-style fully homomorphic encryption in practice
• Lattice-based multi-key homomorphic signatures forward-unforgeable against signing key leakage

This page was built for publication: Worst-case to average-case reductions based on Gaussian measures

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