On Yao's XOR-Lemma

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

Volumn 6650 LNCS, Issue , 2011, Pages 273-301

  Goldreich, Oded ^a   Nisan, Noam ^a   Wigderson, Avi ^a  

^a NONE

Author keywords

Direct Product Lemma; Hard Core Predicates; Hard Core Regions; One Way Functions; Yao's XOR Lemma

Indexed keywords

DIRECT PRODUCT; HARD-CORE PREDICATES; HARD-CORE REGIONS; ONE-WAY FUNCTIONS; XOR LEMMA;

ARTIFICIAL INTELLIGENCE;

EID: 84857567375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22670-0_23     Document Type: Article

References (17)

1. Goldreich, O.: Foundation of Cryptography -Class Notes. Computer Science Department, Technion, Haifa, Israel (Spring 1989)
2. Goldreich, O.: Foundation of Cryptography -Fragments of a Book, Available from ECCC (February 1995)
3. Goldreich, O.: Foundation of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)
4. Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008)
5. Goldreich, O., Levin, L.A.: A Hard-Core Predicate for all One-Way Functions. In: 21st STOC, pp. 25-32 (1989)
6. Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A Pseudorandom Generator from any One-way Function. SICOMP 28(4), 1364-1396 (1999); Combines papers of Impagliazzo et al. (21st STOC, 1989) and Hastad (22nd STOC, 1990)
7. Impagliazzo, R.: See [8], which appeared after our first posting (1994) (manuscript)
8. Impagliazzo, R.: Hard-core Distributions for Somewhat Hard Problems. In: 36th FOCS, pp. 538-545 (1995); This is a later version of [7]
9. Impagliazzo, R., Jaiswal, R., Kabanets, V.: Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. In: 47th FOCS, pp. 187-196 (2006)
10. Impagliazzo, R., Jaiswal, R., Kabanets, V.,Wigderson, A.: Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput. 39(4), 1637-1665 (2010); Preliminary version in 40th STOC (2008)
11. Impagliazzo, R., Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In: 29th STOC, pp. 220-229 (1997)
12. Levin, L.A.: One-Way Functions and Pseudorandom Generators. Combinatorica 7(4), 357-363 (1987)
13. Levin, L.A.: Average Case Complete Problems. SICOMP 15, 285-286 (1986)
14. Nisan, N., Rudich, S., Saks, M.: Products and Help Bits in Decision Trees. In: 35th FOCS, pp. 318-329 (1994)
15. Nisan, N., Wigderson, A.: Hardness vs Randomness. JCSS 49(2), 149-167 (1994)
16. Viola, E., Wigderson, A.: Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols. Theory of Computing 4(1), 137-168 (2008); Preliminary version in IEEE Conf. on Comput. Complex. (2007)
17. Yao, A.C.: Theory and Application of Trapdoor Functions. In: 23rd FOCS, pp. 80-91 (1982)