文章基本信息
- 标题：A note on the relation between XOR and Selective XOR Lemmas
- 本地全文：下载
- 作者：Ragesh Jaiswal
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2019
- 卷号：2019
- 页码：1-3
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
Given an unpredictable Boolean function f : 0 1 n 0 1 , the standard Yao's XOR lemma is a statement about the unpredictability of computing i [ k ] f ( x i ) given x 1 x k 0 1 n , whereas the Selective XOR lemma is a statement about the unpredictability of computing i S f ( x i ) given x 1 x k 0 1 n and S 1 k . We give a reduction from the Selective XOR lemma to the standard XOR lemma. Our reduction gives better quantitative bounds for certain choice of parameters and does not require the assumption of being able to sample ( x f ( x )) pairs.
