[MM11b] Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

Authors: Daniele Micciancio, Petros Mol | Venue: CRYPTO 2011 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{C:MicMol11,
  author = {Daniele Micciancio and Petros Mol},
  title = {Pseudorandom Knapsacks and the Sample Complexity of {LWE} Search-to-Decision Reductions},
  pages = {465--484},
  editor = {Phillip Rogaway},
  booktitle = {Advances in Cryptology -- {CRYPTO}~2011},
  volume = {6841},
  series = {Lecture Notes in Computer Science},
  address = {Santa Barbara, CA, USA},
  month = {aug~14--18},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2011},
  doi = {10.1007/978-3-642-22792-9_26},
}