Abstract
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user, and at most β < α for an attacker. One example is a CAPTCHA challenge, where a human should have a significantly higher chance of answering a single challenge (e.g., uncovering a distorted letter) than an attacker. Another example would be an argument system without perfect completeness. A natural approach to boost the gap between legitimate users and attackers would be to issue many challenges, and accept if the response is correct for more than a threshold fraction, for the threshold chosen between α and β. We give the first proof that parallel repetition with thresholds improves the security of such protocols. We do this with a very general result about an attacker’s ability to solve a large fraction of many independent instances of a hard problem, showing a Chernoff-like convergence of the fraction solved incorrectly to the probability of failure for a single instance.
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
Aaronson, S.: Limitations of quantum advice and one-way communication. In: Proceedings of the Nineteenth Annual IEEE Conference on Computational Complexity, pp. 320–332. IEEE Computer Society Press, Los Alamitos (2004)
von Ahn, L., Blum, M., Hopper, N.J., Langford, J.: CAPTCHA: Using hard AI problems for security. In: Biham, E. (ed.) Advances in Cryptology – EUROCRPYT 2003. LNCS, vol. 2656, pp. 294–311. Springer, Heidelberg (2003)
Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity 3, 307–318 (1993)
Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: Proceedings of the Thirty-Eighth Annual IEEE Symposium on Foundations of Computer Science, pp. 374–383. IEEE Computer Society Press, Los Alamitos (1997)
Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics 23, 493–509 (1952)
Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 17–33. Springer, Heidelberg (2005)
Gal, A., Halevi, S., Lipton, R., Petrank, E.: Computing from partial solutions. In: Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, pp. 34–45. IEEE Computer Society Press, Los Alamitos (1999)
Goldreich, O., Nisan, N., Wigderson, A.: On Yao’s XOR-Lemma. Electronic Colloquium on Computational Complexity (TR95-050) (1995)
Holenstein, T.: Key agreement from weak bit agreement. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 664–673. ACM Press, New York (2005)
Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proceedings of the Thirty-Sixth Annual IEEE Symposium on Foundations of Computer Science, pp. 538–545. IEEE Computer Society Press, Los Alamitos (1995)
Impagliazzo, R., Jaiswal, R., Kabanets, V.: Approximately list-decoding direct product codes and uniform hardness amplification. In: FOCS 2006. Proceedings of the Forty-Seventh Annual IEEE Symposium on Foundations of Computer Science, pp. 187–196. IEEE Computer Society Press, Los Alamitos (2006)
Impagliazzo, R., Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220–229. ACM Press, New York (1997)
Klivans, A.R.: On the derandomization of constant depth circuits. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, Springer, Heidelberg (2001)
Klauck, H., Spalek, R., de Wolf, R.: Quantum and classical strong direct product theorems and optimal time-space tradeoffs. In: Proceedings of the Forty-Fifth Annual IEEE Symposium on Foundations of Computer Science, pp. 12–21. IEEE Computer Society Press, Los Alamitos (2004)
Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica 7(4), 357–363 (1987)
Nisan, N., Rudich, S., Saks, M.: Products and help bits in decision trees. In: Proceedings of the Thirty-Fifth Annual IEEE Symposium on Foundations of Computer Science, pp. 318–329. IEEE Computer Society Press, Los Alamitos (1994)
Parnafes, I., Raz, R., Wigderson, A.: Direct product results and the GCD problem, in old and new communication models. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 363–372. ACM Press, New York (1997)
Pass, R., Venkitasubramaniam, M.: An efficient parallel repetition theorem for arthur-merlin games. In: STOC 2007 (to appear)
Pietrzak, K., Wikstrom, D.: Parallel repetition of computationally sound protocols revisited. In: TCC’07 (to appear, 2007)
Raz, R.: A parallel repetition theorem. SIAM Journal on Computing 27(3), 763–803 (1998)
Shaltiel, R.: Towards proving strong direct product theorems. In: Proceedings of the Sixteenth Annual IEEE Conference on Computational Complexity, pp. 107–119. IEEE Computer Society Press, Los Alamitos (2001)
Trevisan, L.: List-decoding using the XOR lemma. In: Proceedings of the Forty-Fourth Annual IEEE Symposium on Foundations of Computer Science, pp. 126–135. IEEE Computer Society Press, Los Alamitos (2003)
Yao, A.C.: Theory and applications of trapdoor functions. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Foundations of Computer Science, pp. 80–91. IEEE Computer Society Press, Los Alamitos (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Impagliazzo, R., Jaiswal, R., Kabanets, V. (2007). Chernoff-Type Direct Product Theorems. In: Menezes, A. (eds) Advances in Cryptology - CRYPTO 2007. CRYPTO 2007. Lecture Notes in Computer Science, vol 4622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74143-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-74143-5_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74142-8
Online ISBN: 978-3-540-74143-5
eBook Packages: Computer ScienceComputer Science (R0)