New Pseudorandom Generators and Correlation Bounds Using Extractors

Author Vinayak M. Kumar



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2025.68.pdf
  • Filesize: 0.95 MB
  • 23 pages

Document Identifiers

Author Details

Vinayak M. Kumar
  • University of Texas at Austin, TX, USA

Acknowledgements

We thank David Zuckerman for helpful discussions. We also thank anonymous reviewers for helpful comments. We thank Jeffrey Champion, Chin Ho Lee, and Geoffrey Mon for comments on an earlier draft of the paper.

Cite As Get BibTex

Vinayak M. Kumar. New Pseudorandom Generators and Correlation Bounds Using Extractors. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 68:1-68:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITCS.2025.68

Abstract

We establish new correlation bounds and pseudorandom generators for a collection of computation models. These models are all natural generalization of structured low-degree 𝔽₂-polynomials that we did not have correlation bounds for before. In particular: 
- We construct a PRG for width-2 poly(n)-length branching programs which read d bits at a time with seed length 2^O(√{log n}) ⋅ d²log²(1/ε). This comes quadratically close to optimal dependence in d and log(1/ε). Improving the dependence on n would imply nontrivial PRGs for log n-degree 𝔽₂-polynomials. The previous PRG by Bogdanov, Dvir, Verbin, and Yehudayoff had an exponentially worse dependence on d with seed length of O(dlog n + d2^dlog(1/ε)).
- We provide the first nontrivial (and nearly optimal) correlation bounds and PRGs against size-n^Ω(log n) AC⁰ circuits with either n^{.99} SYM gates (computing an arbitrary symmetric function) or n^{.49} THR gates (computing an arbitrary linear threshold function). This is a generalization of sparse 𝔽₂-polynomials, which can be simulated by an AC⁰ circuit with one parity gate at the top. Previous work of Servedio and Tan only handled n^{.49} SYM gates or n^{.24} THR gates, and previous work of Lovett and Srinivasan only handled polynomial-size circuits.
- We give exponentially small correlation bounds against degree-n^O(1) 𝔽₂-polynomials which are set-multilinear over some arbitrary partition of the input into n^{1-O(1)} parts (noting that at n parts, we recover all low degree polynomials). This vastly generalizes correlation bounds against degree-d polynomials which are set-multilinear over a fixed partition into d blocks, which were established by Bhrushundi, Harsha, Hatami, Kopparty, and Kumar.
The common technique behind all of these results is to fortify a hard function with the right type of extractor to obtain stronger correlation bounds for more general models of computation. Although this technique has been used in previous work, they rely on the model simplifying drastically under random restrictions. We view our results as a proof of concept that such fortification can be done even for classes that do not enjoy such behavior.

Subject Classification

ACM Subject Classification
  • Theory of computation → Circuit complexity
  • Theory of computation → Pseudorandomness and derandomization
Keywords
  • Pseudorandom Generators
  • Correlation Bounds
  • Constant-Depth Circuits

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Miklos Ajtai and Avi Wigderson. Deterministic simulation of probabilistic constant depth circuits. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pages 11-19, 1985. URL: https://doi.org/10.1109/SFCS.1985.19.
  2. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols and logspace-hard pseudorandom sequences. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC '89, pages 1-11, New York, NY, USA, 1989. Association for Computing Machinery. URL: https://doi.org/10.1145/73007.73008.
  3. Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, and Mrinal Kumar. On Multilinear Forms: Bias, Correlation, and Tensor Rank. In Jarosław Byrka and Raghu Meka, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1-29:23, Dagstuhl, Germany, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.29.
  4. Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, and Emanuele Viola. Fourier growth of structured 𝕗_2-polynomials and applications. In Mary Wootters and Laura Sanità, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference), volume 207 of LIPIcs, pages 53:1-53:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2021.53.
  5. Andrej Bogdanov, Zeev Dvir, Elad Verbin, and Amir Yehudayoff. Pseudorandomness for width-2 branching programs. Theory of Computing, 9(7):283-293, 2013. URL: https://doi.org/10.4086/toc.2013.v009a007.
  6. Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, and David Zuckerman. Extractors and secret sharing against bounded collusion protocols. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1226-1242, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00117.
  7. Eshan Chattopadhyay and Jyun-Jie Liao. Hardness Against Linear Branching Programs and More. In Amnon Ta-Shma, editor, 38th Computational Complexity Conference (CCC 2023), volume 264 of Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1-9:27, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CCC.2023.9.
  8. Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, and David Zuckerman. Mining circuit lower bound proofs for meta-algorithms. In 2014 IEEE 29th Conference on Computational Complexity (CCC), pages 262-273, 2014. URL: https://doi.org/10.1109/CCC.2014.34.
  9. Gil Cohen and Igor Shinkar. The complexity of dnf of parities. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ITCS '16, pages 47-58, New York, NY, USA, 2016. Association for Computing Machinery. URL: https://doi.org/10.1145/2840728.2840734.
  10. Jeff Ford and Anna Gál. Hadamard tensors and lower bounds on multiparty communication complexity. Comput. Complex., 22(3):595-622, 2013. URL: https://doi.org/10.1007/s00037-012-0052-6.
  11. Parikshit Gopalan, Raghu Meka, Omer Reingold, and David Zuckerman. Pseudorandom generators for combinatorial shapes. SIAM Journal on Computing, 42(3):1051-1076, 2013. URL: https://doi.org/10.1137/110854990.
  12. Svyatoslav Gryaznov, Pavel Pudlák, and Navid Talebanfard. Linear branching programs and directional affine extractors. In Proceedings of the 37th Computational Complexity Conference, CCC '22, Dagstuhl, DEU, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CCC.2022.4.
  13. J. Hastad and M. Goldmann. On the power of small-depth threshold circuits. In Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pages 610-618 vol.2, 1990. URL: https://doi.org/10.1109/FSCS.1990.89582.
  14. Pooya Hatami and William Hoza. Theory of unconditional pseudorandom generators. Electron. Colloquium Comput. Complex., TR23-019, 2023. URL: https://eccc.weizmann.ac.il/report/2023/019, URL: https://arxiv.org/abs/TR23-019.
  15. Pooya Hatami, William M. Hoza, Avishay Tal, and Roei Tell. Fooling constant-depth threshold circuits (extended abstract). In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 104-115, 2022. URL: https://doi.org/10.1109/FOCS52979.2021.00019.
  16. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC '89, pages 12-24, New York, NY, USA, 1989. Association for Computing Machinery. URL: https://doi.org/10.1145/73007.73009.
  17. Jesse Kamp and David Zuckerman. Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing, 36(5):1231-1247, 2007. URL: https://doi.org/10.1137/S0097539705446846.
  18. Ilan Komargodski, Ran Raz, and Avishay Tal. Improved average-case lower bounds for demorgan formula size. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 588-597, 2013. URL: https://doi.org/10.1109/FOCS.2013.69.
  19. Xin Li and Yan Zhong. Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs. In Rahul Santhanam, editor, 39th Computational Complexity Conference (CCC 2024), volume 300 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1-10:14, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CCC.2024.10.
  20. Shachar Lovett and Srikanth Srinivasan. Correlation bounds for poly-size ac0 circuits with n(1-o(1)) symmetric gates. In Leslie Ann Goldberg, Klaus Jansen, R. Ravi, and José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 640-651, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg. Google Scholar
  21. M. Luby, B. Velickovic, and A. Wigderson. Deterministic approximate counting of depth-2 circuits. In [1993] The 2nd Israel Symposium on Theory and Computing Systems, pages 18-24, 1993. URL: https://doi.org/10.1109/ISTCS.1993.253488.
  22. Xin Lyu. Improved pseudorandom generators for ac0 circuits. In Proceedings of the 37th Computational Complexity Conference, CCC '22, Dagstuhl, DEU, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CCC.2022.34.
  23. Noam Nisan. The communication complexity of threshold gates. Combinatorics, Paul Erdős is eighty, Vol. 1, 1993. Google Scholar
  24. Noam Nisan and Avi Wigderson. Hardness vs randomness. Journal of computer and System Sciences, 49(2):149-167, 1994. URL: https://doi.org/10.1016/S0022-0000(05)80043-1.
  25. Alexander Razborov and Avi Wigderson. w(log n) lower bounds on the size of depth-3 threshold cicuits with and gates at the bottom. Information Processing Letters, 45(6):303-307, 1993. URL: https://doi.org/10.1016/0020-0190(93)90041-7.
  26. Rocco A. Servedio and Li-Yang Tan. Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits. In Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), volume 116 of Leibniz International Proceedings in Informatics (LIPIcs), pages 56:1-56:20, Dagstuhl, Germany, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.56.
  27. Rocco A. Servedio and Li-Yang Tan. Improved pseudorandom generators from pseudorandom multi-switching lemmas. Theory Comput., 18:1-46, 2022. URL: https://theoryofcomputing.org/articles/v018a004/, URL: https://doi.org/10.4086/TOC.2022.V018A004.
  28. Emanuele Viola. Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates. SIAM Journal on Computing, 36(5):1387-1403, 2007. URL: https://doi.org/10.1137/050640941.
  29. Emanuele Viola. The sum of d small-bias generators fools polynomials of degree d. In 2008 23rd Annual IEEE Conference on Computational Complexity, pages 124-127, 2008. URL: https://doi.org/10.1109/CCC.2008.16.
  30. Emanuele Viola. Correlation bounds against polynomials. Electron. Colloquium Comput. Complex., TR22-142, 2022. URL: https://eccc.weizmann.ac.il/report/2022/142, URL: https://arxiv.org/abs/TR22-142.
  31. Emanuele Viola and Avi Wigderson. Norms, xor lemmas, and lower bounds for gf(2) polynomials and multiparty protocols. In Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), pages 141-154, 2007. URL: https://doi.org/10.1109/CCC.2007.15.
  32. Thomas Watson. Pseudorandom generators for combinatorial checkerboards. In 2011 IEEE 26th Annual Conference on Computational Complexity, pages 232-242, 2011. URL: https://doi.org/10.1109/CCC.2011.12.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail