International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Hardness Amplification of Weakly Verifiable Puzzles

Authors:
Ran Canetti
Shai Halevi
Michael Steiner
Download:
DOI: 10.1007/978-3-540-30576-7_2
URL: https://iacr.org/archive/tcc2005/3378_020/3378_020.pdf
Search ePrint
Search Google
Conference: TCC 2005
BibTeX
@inproceedings{tcc-2005-3610,
  title={Hardness Amplification of Weakly Verifiable Puzzles},
  booktitle={Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={3378},
  pages={17-33},
  url={https://iacr.org/archive/tcc2005/3378_020/3378_020.pdf},
  doi={10.1007/978-3-540-30576-7_2},
  author={Ran Canetti and Shai Halevi and Michael Steiner},
  year=2005
}