Constructive proofs of concentration bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 617-631

  Impagliazzo, Russell ^a   Kabanets, Valentine ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149314968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_46     Document Type: Conference Paper

References (40)

1. von Ahn, L., Blum, M., Hopper, N.J., Langford, J.: CAPTCHA: Using hard AI problems for security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 294-311. Springer, Heidelberg (2003)
2. Ajtai, M., Komlos, J., Szemeredy, E.: Deterministic simulation in LOGSPACE. In: STOC, pp. 132-140 (1987)
3. Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Comp. Compl. 5(1), 60-75 (1995)
4. Azuma, K.: Weighted sums of certain dependent random variables. Tohoku Math. J. 19, 357-367 (1967)
5. Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: FOCS, pp. 374-383 (1997)
6. Ben-Aroya, A., Regev, O., de Wolf, R.: A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. In: FOCS, pp. 477-486 (2008)
7. Bernstein, S.N.: Collected works, vol. 4. Nauka, Moscow (1964) (in Russian)
8. 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)
9. Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493-509 (1952)
10. Chung, K.M., Liu, F.H.: Tight parallel repetition theorems for public-coin arguments. In: Micciancio, D. (ed.) Theory of Cryptography. LNCS, vol. 5978, pp. 19-36. Springer, Heidelberg (2010)
11. Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Perfect parallel repetition theorem for quantum XOR proof systems. In: CCC, pp. 109-114 (2007)
12. Gillman, D.: A Chernoff bound for random walks on expander graphs. SICOMP 27(4), 1203-1220 (1998)
13. Goldreich, O., Nisan, N., Wigderson, A.: On Yao's XOR-Lemma. In: ECCC (1995)
14. Haitner, I.: A parallel repetition theorem for any interactive argument. In: FOCS, pp. 241-250 (2009)
15. Healy, A.: Randomness-efficient sampling within NC1. Comp. Compl. 17(1), 3-37 (2008)
16. Hoeffding, W.: Probability inequalities for sums of bounded random variables. American Stat. J., 13-30 (1963)
17. Holenstein, T.: Key agreement from weak bit agreement. In: STOC (2005)
18. Holenstein, T.: Parallel repetition: Simplifications and the no-signaling case. In: STOC, pp. 411-419 (2007)
19. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. AMS 43(4), 439-561 (2006)
20. Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: FOCS (1995)
21. Impagliazzo, R., Jaiswal, R., Kabanets, V.: Approximately list-decoding direct product codes and uniform hardness amplification. SICOMP 39(2), 564-605 (2009)
22. Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. J. Cryptology 22(1), 75-92 (2009)
23. Impagliazzo, R., Jaiswal, R., Kabanets, V., Wigderson, A.: Uniform direct-product theorems: Simplified, optimized, and derandomized. SICOMP 39(4), 1637-1665 (2010)
24. Impagliazzo, R., Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In: STOC, pp. 220-229 (1997)
25. Janson, S., Luczak, T., Rucinski, A.: Random Graphs (2000)
26. Jogdeo, K., Samuels, S.: Monotone convergence of binomial probabilities and a generalization of Ramanujan's equation. Ann. Math. Stat. 39, 1191-1195 (1968)
27. Jutla, C.S.: Almost optimal bounds for direct product threshold theorem. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 37-51. Springer, Heidelberg (2010)
28. Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica 7(4), 357-363 (1987)
29. Nisan, N., Rudich, S., Saks, M.: Products and help bits in decision trees. In: FOCS, pp. 318-329 (1994)
30. Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SICOMP 26(2), 350-368 (1997) (Pubitemid 127652069)
31. Parnafes, I., Raz, R., Wigderson, A.: Direct product results and the GCD problem, in old and new communication models. In: STOC, pp. 363-372 (1997)
32. Pietrzak, K., Wikström, D.: Parallel repetition of computationally sound protocols revisited. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 86-102. Springer, Heidelberg (2007)
33. Rao, A.: Parallel repetition in projection games and a concentration bound. In: STOC, pp. 1-10 (2008)
34. Raz, R.: A parallel repetition theorem. SICOMP 27(3), 763-803 (1998)
35. Raz, R.: A counterexample to strong parallel repetition. In: FOCS (2008)
36. Shaltiel, R.: Towards proving strong direct product theorems. Comp. Compl. 12(1-2), 1-22 (2003)
37. Siegel, A.: Median bounds and their application. J. Algo. 38, 184-236 (2001)
38. Unger, F.: A probabilistic inequality with applications to threshold direct-product theorems. In: FOCS, pp. 221-229 (2009)
39. Viola, E., Wigderson, A.: Norms, XOR lemmas, and lower bounds for polynomials and protocols. Theory Comp. 4(1), 137-168 (2008)
40. Yao, A.C.: Theory and applications of trapdoor functions. In: FOCS (1982)