DMCA
On Yao’s XOR lemma (1995)
Cached
Download Links
| Venue: | Electronic Colloquium on Computational Complexity |
| Citations: | 65 - 6 self |
BibTeX
@TECHREPORT{Goldreich95onyao’s,
author = {Oded Goldreich and Noam Nisan and Avi Wigderson},
title = {On Yao’s XOR lemma},
institution = {Electronic Colloquium on Computational Complexity},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. A fundamental lemma of Yao states that computational weakunpredictability 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.
