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

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 14 CITATIONS

    A reverse Minkowski theorem

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping

    VIEW 3 EXCERPTS
    CITES METHODS & BACKGROUND

    Discrete Gaussian measures and new bounds of the smoothing parameter for lattices

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Parameter selection in lattice-based cryptography

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Towards Strong Reverse Minkowski-Type Inequalities for Lattices

    • Daniel Dadush, Oded Regev
    • Computer Science, Mathematics
    • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2016
    VIEW 2 EXCERPTS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 44 REFERENCES

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

    VIEW 13 EXCERPTS
    HIGHLY INFLUENTIAL

    Private coins versus public coins in interactive proof systems

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    On lattices, learning with errors, random linear codes, and cryptography

    • Oded Regev
    • Mathematics, Computer Science
    • STOC '05
    • 2005
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    New lattice-based cryptographic constructions

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Efficient Fully Homomorphic Encryption from (Standard) LWE