## Abstract

Yao’s XOR lemma states that for every function f: { 0 , 1 } ^{k}→ { 0 , 1 } , if f has hardness 2/3 for P/poly (meaning that for every circuit C in P/poly, Pr [C(X) = f(X)] ≤ 2 / 3 on a uniform input X), then the task of computing f(X_{1}) ⊕ … ⊕ f(X_{t}) for sufficiently large t has hardness 12+ϵ for P/poly. Known proofs of this lemma cannot achieve ϵ=1kω(1) , and even for ϵ=1k , we do not know how to replaceP/poly by AC^{0}[parity] (the class of constant depth circuits with the gates {and, or, not, parity} of unbounded fan-in). Grinberg, Shaltiel and Viola (FOCS 2018) (building on a sequence of earlier works) showed that these limitations cannot be circumvented by black-box reductions. Namely, by reductions Red ^{(·)} that given oracle access to a function D that violates the conclusion of Yao’s XOR lemma, implement a circuit that violates the assumption of Yao’s XOR lemma. There are a few known reductions in the related literature on worst-case to average-case reductions that are non-black-box. Specifically, the reductions of Gutfreund, Shaltiel and Ta-Shma (Computational Complexity 2007) and Hirahara (FOCS 2018)) are “class reductions” that are only guaranteed to succeed when given oracle access to an oracle D from some efficient class of algorithms. These works seem to circumvent some black-box impossibility results. In this paper, we extend the previous limitations of Grinberg, Shaltiel and Viola to several types of class reductions, giving evidence that class reductions cannot yield the desired improvements in Yao’s XOR lemma. To the best of our knowledge, this is the first limitation on reductions for hardness amplification that applies to class reductions. Our technique imitates the previous lower bounds for black-box reductions, replacing the inefficient oracle used in that proof, with an efficient one that is based on limited independence, and developing tools to deal with the technical difficulties that arise following this replacement.

Original language | English |
---|---|

Article number | 5 |

Journal | Computational Complexity |

Volume | 32 |

Issue number | 1 |

DOIs | |

State | Published - Jun 2023 |

### Bibliographical note

Funding Information:A preliminary version of this paper appeared in RANDOM 2020 (Shaltiel 2020). We are grateful to Emanuele Viola for very helpful discussions, and to anonymous referees for excellent comments and suggestions.

Publisher Copyright:

© 2023, The Author(s), under exclusive licence to Springer Nature Switzerland AG.

## Keywords

- 68Q17
- Average-case complexity
- black-boxreductions
- Yao’s XOR lemma

## ASJC Scopus subject areas

- Theoretical Computer Science
- Mathematics (all)
- Computational Theory and Mathematics
- Computational Mathematics