{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:01:54Z","timestamp":1757541714549},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_2","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"17-33","source":"Crossref","is-referenced-by-count":50,"title":["Hardness Amplification of Weakly Verifiable Puzzles"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Steiner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/3-540-39200-9_18","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"L. Ahn von","year":"2003","unstructured":"von Ahn, L., Blum, M., Hopper, N., Langford, J.: CAPTCHA: Using hard AI problems for security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 294\u2013311. Springer, Heidelberg (2003)"},{"key":"2_CR2","first-page":"374","volume-title":"38th Annual Symposium on Foundations of Computer Science (FOCS 1997)","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 374\u2013383. IEEE, Los Alamitos (1997)"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0022-0000(92)90019-F","volume":"44","author":"S. Ben-David","year":"1992","unstructured":"Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the theory of average case complexity. Journal of Computer and System Sciences\u00a044(2), 193\u2013219 (1992); Preliminary version in STOC 1989","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/276698.276722","volume-title":"Proceedings of the thirtieth annual ACM symposium on theory of computing (STOC 1998)","author":"G. Di Crescenzo","year":"1998","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: Proceedings of the thirtieth annual ACM symposium on theory of computing (STOC 1998), pp. 141\u2013150. ACM Press, New York (1998)"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. on Computing\u00a030(2), 391\u2013437 (2000); Preliminary version in STOC 1991","journal-title":"SIAM J. on Computing"},{"key":"2_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography, Basic tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography, Basic tools. Cambridge University Press, Cambridge (2001)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1109\/FSCS.1990.89604","volume-title":"31st Annual Symposium on Foundations of Computer Science (FOCS 1990)","author":"R. Impagliazzo","year":"1990","unstructured":"Impagliazzo, R., Levin, L.A.: No better ways to generate hard NP instances than picking uniformly at random. In: 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), pp. 812\u2013821. IEEE, Los Alamitos (1990)"},{"key":"2_CR8","unstructured":"Juels, A., Brainard, J.: Client puzzles: A cryptographic defense against connection depletion attacks. In: Proceedings of the 1999 Network and Distributed System Security Symposium (NDSS 1999), pp. 151\u2013165. Internet Society (ISOC) (1999)"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L.A. Levin","year":"1986","unstructured":"Levin, L.A.: Average case complete problems. SIAM Journal of Computing\u00a015(1), 285\u2013286 (1986); Preliminary version in STOC 1984","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"2_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00145-002-0007-1","volume":"16","author":"S. Myers","year":"2003","unstructured":"Myers, S.: Efficient amplification of the security of weak pseudo-random function generators. Journal of Cryptology\u00a016(1), 1\u201324 (2003); Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 358. Springer, Heidelberg (2001)","journal-title":"Journal of Cryptology"},{"key":"2_CR11","unstructured":"Naor, M.: Verification of a human in the loop or identification via the Turing test. Manuscript, available on-line (1996), \n                    \n                      http:\/\/www.wisdom.weizmann.ac.il\/~naor\/PAPERS\/human_abs.html"},{"key":"2_CR12","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and time-released crypto. Technical Report MIT\/LCS\/TR-684, MIT laboratory for Computer Science (1996)"},{"key":"2_CR13","first-page":"80","volume-title":"23rd Annual Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science, pp. 80\u201391. IEEE, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:56Z","timestamp":1620012656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}