• DOI:10.1109/CCC.2013.31
Corpus ID: 1299735

On the Lattice Smoothing Parameter Problem

@article{Chung2013OnTL,
  title={On the Lattice Smoothing Parameter Problem},
  author={Kai-Min Chung and Daniel Dadush and Feng-Hao Liu and Chris Peikert},
  journal={2013 IEEE Conference on Computational Complexity},
  year={2013},
  pages={230-241}
}

Kai-Min Chung, Daniel Dadush, +1 author Chris Peikert

Published in

IEEE Conference on…

2013

Mathematics, Computer Science

The smoothing parameter ηε(L) of a Euclidean lattice L, introduced by Micciancio and Regev (FOCS'04; SICOMP'07), is (informally) the smallest amount of Gaussian noise that “smooths out” the discrete structure of L (up to error ε). It plays a central role in the best known worst-case/average-case reductions for lattice problems, a wealth of lattice-based cryptographic constructions, and (implicitly) the tightest known transference theorems for fundamental lattice quantities. In this work we… CONTINUE READING

View on IEEE

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed