## Abstract

Is it harder to solve many puzzles than it is to solve just one? This question has different answers, depending on how you define puzzles. For the case of inverting one-way functions it was shown by Yao that solving many independent instances simultaneously is indeed harder than solving a single instance (cf. the transformation from weak to strong one-way functions). The known proofs of that result, however, use in an essential way the fact that for one-way functions, verifying candidate solutions to a given puzzle is easy. We extend this result to the case where solutions are efficiently verifiable *only by the party that generated the puzzle.* We call such puzzles weakly verifiable. That is, for weakly verifiable puzzles we show that if no efficient algorithm can solve a single puzzle with probability more than *ε*, then no efficient algorithm can solve *n* independent puzzles simultaneously with probability more than *ε*
^{n}. We also demonstrate that when the puzzles are not even weakly verifiable, solving many puzzles may be no harder than solving a single one.

Hardness amplification of weakly verifiable puzzles turns out to be closely related to the reduction of soundness error under parallel repetition in computationally sound arguments. Indeed, the proof of Bellare, Impagliazzo and Naor that parallel repetition reduces soundness error in three-round argument systems implies a result similar to our first result, albeit with considerably worse parameters. Also, our second result is an adaptation of their proof that parallel repetition of four-round systems may not reduce the soundness error.

## Chapter PDF

### Similar content being viewed by others

## Keywords

*These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.*

## References

von Ahn, L., Blum, M., Hopper, N., Langford, J.: CAPTCHA: Using hard AI problems for security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 294–311. Springer, Heidelberg (2003)

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–383. IEEE, Los Alamitos (1997)

Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the theory of average case complexity. Journal of Computer and System Sciences 44(2), 193–219 (1992); Preliminary version in STOC 1989

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–150. ACM Press, New York (1998)

Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. on Computing 30(2), 391–437 (2000); Preliminary version in STOC 1991

Goldreich, O.: Foundations of Cryptography, Basic tools. Cambridge University Press, Cambridge (2001)

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–821. IEEE, Los Alamitos (1990)

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–165. Internet Society (ISOC) (1999)

Levin, L.A.: Average case complete problems. SIAM Journal of Computing 15(1), 285–286 (1986); Preliminary version in STOC 1984

Myers, S.: Efficient amplification of the security of weak pseudo-random function generators. Journal of Cryptology 16(1), 1–24 (2003); Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 358. Springer, Heidelberg (2001)

Naor, M.: Verification of a human in the loop or identification via the Turing test. Manuscript, available on-line (1996), http://www.wisdom.weizmann.ac.il/~naor/PAPERS/human_abs.html

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)

Yao, A.C.: Theory and applications of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science, pp. 80–91. IEEE, Los Alamitos (1982)

## Author information

### Authors and Affiliations

## Editor information

### Editors and Affiliations

## Rights and permissions

## Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

## About this paper

### Cite this paper

Canetti, R., Halevi, S., Steiner, M. (2005). Hardness Amplification of Weakly Verifiable Puzzles. In: Kilian, J. (eds) Theory of Cryptography. TCC 2005. Lecture Notes in Computer Science, vol 3378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30576-7_2

### Download citation

DOI: https://doi.org/10.1007/978-3-540-30576-7_2

Publisher Name: Springer, Berlin, Heidelberg

Print ISBN: 978-3-540-24573-5

Online ISBN: 978-3-540-30576-7

eBook Packages: Computer ScienceComputer Science (R0)