General Hardness Amplification of Predicates and Puzzles - (Extended Abstract)

Thomas Holenstein, Grant Schoenebeck. General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). In Yuval Ishai, editor, Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings. Volume 6597 of Lecture Notes in Computer Science, pages 19-36, Springer, 2011. [doi]

@inproceedings{HolensteinS11,
  title = {General Hardness Amplification of Predicates and Puzzles - (Extended Abstract)},
  author = {Thomas Holenstein and Grant Schoenebeck},
  year = {2011},
  doi = {10.1007/978-3-642-19571-6_2},
  url = {http://dx.doi.org/10.1007/978-3-642-19571-6_2},
  researchr = {https://researchr.org/publication/HolensteinS11},
  cites = {0},
  citedby = {0},
  pages = {19-36},
  booktitle = {Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings},
  editor = {Yuval Ishai},
  volume = {6597},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
}