## An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme

- Daniel Cabarcas, Denise Demirel, Florian Göpfert, Jean Lancrenon, Thomas Wunderer
- IACR Cryptology ePrint Archive
- 2015

Highly Influenced

7 Excerpts

- Published 2004 in 45th Annual IEEE Symposium on Foundations of…

We show that solving modular linear equation on the average is at least as hard as approximating several lattice problems in the worst case within a factor almost linear in the rank of the lattice. The lattice problems we consider are the shortest vector problem, the shortest independent vectors problem and the covering radius problem. The approximation factor we obtain is O(n) for all three problems. This greatly improves on all previous work on the subject starting from Ajtai's seminal paper (STOC, 1996), up to the strongest previously known results by Micciancio (STOC, 2002). Our results also bring us closer to the limit where the problems are no longer known to be in NP /spl cap/ coNP. Our main tools are Gaussian measures on lattices and the high dimensional Fourier transform. We start by defining a new lattice parameter which determines the amount of Gaussian noise that one has to add to a lattice in order to get close to a uniform distribution, in addition to yielding quantitatively much stronger results, the use of this parameter allows us to simplify many of the complications in previous work. Our technical contributions are two-fold. First, we show tight connections between this new parameter and existing lattice parameters. One such important connection is between this parameter and the length of the shortest set of linearly independent vectors. Second, we prove that the distribution that one obtains after adding Gaussian noise to the lattice has the following interesting property: the distribution of the noise vector when conditioning on the final value behaves in many respects like the original Gaussian noise vector. In particular, its moments remain essentially unchanged.

Citations per Year

Semantic Scholar estimates that this publication has **581** citations based on the available data.

See our **FAQ** for additional information.

Showing 1-10 of 340 extracted citations

Highly Influenced

7 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

10 Excerpts

Highly Influenced

20 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

10 Excerpts

Highly Influenced

9 Excerpts

@article{Micciancio2004WorstcaseTA,
title={Worst-case to average-case reductions based on Gaussian measures},
author={Daniele Micciancio and Oded Regev},
journal={45th Annual IEEE Symposium on Foundations of Computer Science},
year={2004},
pages={372-381}
}