@inbook{ec6f0c51401740908cb132c2ded88859,

title = "On Yao's XOR-Lemma",

abstract = "A fundamental lemma of Yao states that computational weak-unpredictability of Boolean predicates is amplified when the results of several independent instances are XOR together. We survey two known proofs of Yao's Lemma and present a third alternative proof. The third proof proceeds by first proving that a function constructed by concatenating the values of the original function on several independent instances is much more unpredictable, with respect to specified complexity bounds, than the original function. This statement turns out to be easier to prove than the XOR-Lemma. Using a result of Goldreich and Levin (1989) and some elementary observation, we derive the XOR-Lemma.",

keywords = "Direct Product Lemma, Hard-Core Predicates, Hard-Core Regions, One-Way Functions, Yao's XOR Lemma",

author = "Oded Goldreich and Noam Nisan and Avi Wigderson",

year = "2011",

doi = "10.1007/978-3-642-22670-0_23",

language = "American English",

isbn = "9783642226694",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "273--301",

editor = "Oded Goldreich",

booktitle = "Studies in Complexity and Cryptography",

}