Guest Column: New ways of studying the BPP = P conjecture
Authors: 
Lijie Chen, Roei TellAuthors Info & Claims
Lijie Chen, Roei TellAuthors Info & ClaimsAbstract
What's new in the world of derandomization? Questions about pseudorandomness and derandomization have been driving progress in complexity theory for many decades. In this survey we will describe new approaches to the BPP = P conjecture from recent years, as well as new questions, algorithmic approaches, and ways of thinking. For example: Do we really need pseudorandom generators for derandomization, or can we get away with weaker objects? Can we prove free lunch theorems, eliminating randomness with zero computational overhead? What hardness assumptions are necessary and sufficient for derandomization? And how do new advances in this area interact with progress in cryptography and in interactive proof systems?
References
[1]
[AB09] Sanjeev Arora and Boaz Barak. Computational complexity: A modern approach. Cambridge University Press, Cambridge, 2009.
[2]
[AGV09] Adi Akavia, Shafi Goldwasser, and Vinod Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks. In Theory of cryptography, volume 5444, pages 474--495. 2009.
[3]
[AKS04] Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. PRIMES is in P. Annals of Mathematics. Second Series, 160(2):781--793, 2004.
[4]
[AMS99] Noga Alon, Yossi Matias, and Mario Szegedy. The space complexity of approximating the frequency moments. volume 58, pages 137--147. 1999. Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996).
[5]
[Bar02] Boaz Barak. A probabilistic-time hierarchy theorem for "slightly non-uniform" algorithms. In Proc. 6th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), volume 2483, pages 194--208. 2002.
[6]
[BF99] Harry Buhrman and Lance Fortnow. One-sided versus two-sided error in probabilistic computation. In Proc. 16th Symposium on Theoretical Aspects of Computer Science (STACS), pages 100--109, 1999.
[7]
[BFNW93] L´aszl´o Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307--318, 1993.
[8]
[BM84] Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal of Computing, 13(4):850--864, 1984.
[9]
[CCH+19] Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, and Daniel Wichs. Fiat-Shamir: from practice to theory. In Proc. 51st Annual ACM Symposium on Theory of Computing (STOC), pages 1082--1090, 2019.
[10]
[CGI+16] Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, and Stefan Schneider. Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility. In Proc. 7th Conference on Innovations in Theoretical Computer Science (ITCS), pages 261--270, 2016.
[11]
[Che19] Lijie Chen. Non-deterministic quasi-polynomial time is average-case hard for ACC circuits. In Proc. 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1281--1304, 2019.
[12]
[CIS18] Marco L. Carmosino, Russell Impagliazzo, and Manuel Sabin. Fine-grained derandomization: from problem-centric to resource-centric complexity. In Proc. 45th International Colloquium on Automata, Languages and Programming (ICALP), pages 27:1--27:16, 2018.
[13]
[CJJ21] Arka Rai Choudhuri, Abhishek Jain, and Zhengzhong Jin. SNARGs for P from LWE. In Proc. 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 68--79, 2021.
[14]
[CJSW21] Lijie Chen, Ce Jin, Rahul Santhanam, and Ryan Williams. Constructive separations and their consequences. In Proc. 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 646--657, 2021.
[15]
[CLO+23] Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, and Rahul Santhanam. Polynomial-time pseudodeterministic construction of primes, 2023. Under Submission.
[16]
[CLW20] Lijie Chen, Xin Lyu, and Richard Ryan Williams. Almost-everywhere circuit lower bounds from non-trivial derandomization. In Proc. 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1--12, 2020.
[17]
[CNS99] Jin-Yi Cai, Ajay Nerurkar, and D. Sivakumar. Hardness and hierarchy theorems for probabilistic quasi-polynomial time. In Proc. 31st Annual ACM Symposium on Theory of Computing (STOC) ), pages 726--735, 1999.
[18]
[CR20] Lijie Chen and Hanlin Ren. Strong average-case lower bounds from non-trivial derandomization. In Proc. 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 1327--1334, 2020.
[19]
[CRT22] Lijie Chen, Ron D. Rothblum, and Roei Tell. Unstructured hardness to average-case randomness. In Proc. 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2022.
[20]
[CRTY20] Lijie Chen, Ron D. Rothblum, Roei Tell, and Eylon Yogev. On exponential-time hypotheses, derandomization, and circuit lower bounds. In Proc. 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 13--23, 2020.
[21]
[CT21a] Lijie Chen and Roei Tell. Hardness vs randomness, revised: Uniform, non-black-box, and instance-wise. In Proc. 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 125--136, 2021.
[22]
[CT21b] Lijie Chen and Roei Tell. Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost. In Proc. 53st Annual ACM Symposium on Theory of Computing (STOC), pages 283--291, 2021.
[23]
[CT23] Lijie Chen and Roei Tell. When Arthur has neither random coins nor time to spare: Superfast derandomization of proof systems. In Proc. 55th Annual ACM Symposium on Theory of Computing (STOC), 2023.
[24]
[CTW23] Lijie Chen, Roei Tell, and R. Ryan Williams. Derandomization vs refutation: A unified framework for characterizing derandomization, 2023. Under Submission.
[25]
[DMOZ20] Dean Doron, Dana Moshkovitz, Justin Oh, and David Zuckerman. Nearly optimal pseudorandomness from hardness. In Proc. 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1057--1068, 2020.
[26]
[DP08] Stefan Dziembowski and Krzysztof Pietrzak. Leakage-resilient cryptography. In Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 293--302, 2008.
[27]
[DT23] Dean Doron and Roei Tell. Derandomization with minimal memory footprint. Electronic Colloquium on Computational Complexity: ECCC, 30:036, 2023.
[28]
[FGM+89] Martin F¨urer, Oded Goldreich, Yishay Mansour, Michael Sipser, and Stathis Zachos. On completeness and soundness in interactive proof systems. Advances in Computing Research, 5, 1989.
[29]
[FS86] Amos Fiat and Adi Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in cryptology-CRYPTO, pages 186--194. 1986.
[30]
[GG11] Eran Gat and Shafi Goldwasser. Probabilistic search algorithms with unique answers and their cryptographic applications. Electronic Colloquium on Computational Complexity: ECCC, 18:136, 2011.
[31]
[Gil77] John Gill. Computational complexity of probabilistic Turing machines. SIAM Journal of Computing, 6(4):675--695, 1977.
[32]
[GKR15] Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. Delegating computation: interactive proofs for muggles. Journal of the ACM, 62(4):27:1--27:64, 2015.
[33]
[Gol08] Oded Goldreich. Computational Complexity: A Conceptual Perspective. Cambridge University Press, New York, NY, USA, 2008.
[34]
[Gol11] Oded Goldreich. In a world of P=BPP. In Studies in Complexity and Cryptography. Miscellanea on the Interplay Randomness and Computation, pages 191--232, 2011.
[35]
[GSTS03] Dan Gutfreund, Ronen Shaltiel, and Amnon Ta-Shma. Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity, 12(3--4):85--130, 2003.
[36]
[GSTS07] Dan Gutfreund, Ronen Shaltiel, and Amnon Ta-Shma. If NP languages are hard on the worst-case, then it is easy to find their hard instances. Computational Complexity, 16(4):412--441, 2007.
[37]
[GV08] Dan Gutfreund and Salil Vadhan. Limitations of hardness vs. randomness under uniform reductions. In Proc. 12th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), pages 469--482, 2008.
[38]
[GVW11] Oded Goldreich, Salil Vadhan, and Avi Wigderson. Simplified derandomization of BPP using a hitting set generator. In Studies in complexity and cryptography, volume 6650 of Lecture Notes in Computer Science, pages 59--67. Springer, Heidelberg, 2011.
[39]
[HLR21] Justin Holmgren, Alex Lombardi, and Ron D. Rothblum. Fiat-Shamir via listrecoverable codes (or: parallel repetition of GMW is not zero-knowledge). In Proc. 53rd Annual ACM Symposium on Theory of Computing (STOC), pages 750--760, 2021.
[40]
[IKW02] Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson. In search of an easy witness: exponential time vs. probabilistic polynomial time. Journal of Computer and System Sciences, 65(4):672--694, 2002.
[41]
[IP01] Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-SAT. Journal of Computer and System Sciences, 62(2):367--375, 2001.
[42]
[IPZ01] Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63(4):512--530, 2001.
[43]
[ISW03] Yuval Ishai, Amit Sahai, and DavidWagner. Private circuits: securing hardware against probing attacks. In Advances in cryptology-CRYPTO, pages 463--481. 2003.
[44]
[IW97] Russell Impagliazzo and Avi Wigderson. P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), pages 220--229, 1997.
[45]
[IW98] Russell Impagliazzo and Avi Wigderson. Randomness vs. time: De-randomization under a uniform assumption. In Proc. 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 734--743, 1998.
[46]
[Kab01] Valentine Kabanets. Easiness assumptions and hardness tests: trading time for zero error. Journal of Computer and System Sciences, 63(2):236--252, 2001.
[47]
[Kor22] Oliver Korten. Derandomization from time-space tradeoffs. In Proc. 37th Annual IEEE Conference on Computational Complexity (CCC), volume 234 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 37, 26. 2022.
[48]
[KvM02] Adam R. Klivans and Dieter van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput., 31(5):1501--1526, 2002.
[49]
[Lau83] Clemens Lautemann. BPP and the polynomial hierarchy. Information Processing Letters, 17(4):215--217, 1983.
[50]
[LP20] Yanyi Liu and Rafael Pass. On one-way functions and Kolmogorov complexity. In Proc. 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1243--1254. 2020.
[51]
[LP22a] Yanyi Liu and Rafael Pass. Characterizing derandomization through hardness of Levin- Kolmogorov complexity. In Proc. 37th Annual IEEE Conference on Computational Complexity (CCC), volume 234 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 35, 17. 2022.
[52]
[LP22b] Yanyi Liu and Rafael Pass. Leakage-resilient hardness v.s. randomness. Electronic Colloquium on Computational Complexity: ECCC, TR22--113, 2022.
[53]
[LP22c] Yanyi Liu and Rafael Pass. On one-way functions from NP-complete problems. In Proc. 37th Annual IEEE Conference on Computational Complexity (CCC), pages 36:1--36:24, 2022.
[54]
[Mau92] Ueli M. Maurer. Factoring with an oracle. In Proc. Advances in cryptology (EUROCRYPT), pages 429--436. 1992.
[55]
[Mic00] Silvio Micali. Computationally sound proofs. SIAM Journal of Computing, 30(4):1253-- 1298, 2000.
[56]
[MR04] Silvio Micali and Leonid Reyzin. Physically observable cryptography (extended abstract). In Theory of cryptography, pages 278--296. 2004.
[57]
[MV05] Peter Bro Miltersen and N. V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. Computational Complexity, 14(3):256--279, 2005.
[58]
[MW18] Cody Murray and R. Ryan Williams. Circuit lower bounds for nondeterministic quasipolytime: An easy witness lemma for NP and NQP. In Proc. 50th Annual ACM Symposium on Theory of Computing (STOC), pages 890--901, 2018.
[59]
[Nis91] Noam Nisan. Pseudorandom bits for constant depth circuits. Combinatorica, 11(1):63-- 70, 1991.
[60]
[NW94] Noam Nisan and Avi Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49(2):149--167, 1994.
[61]
[OS17] Igor C. Oliveira and Rahul Santhanam. Pseudodeterministic constructions in subexponential time. In Proc. 49th Annual ACM Symposium on Theory of Computing (STOC), pages 665--677, 2017.
[62]
[PS19] Chris Peikert and Sina Shiehian. Noninteractive zero knowledge for NP from (plain) learning with errors. In Advances in Cryptology - CRYPTO, pages 89--114, 2019.
[63]
[Rei08] Omer Reingold. Undirected connectivity in log-space. J. ACM, 55(4):17:1--17:24, 2008.
[64]
[RRR18] Omer Reingold, Guy N. Rothblum, and Ron D. Rothblum. Efficient Batch Verification for UP. In Proc. 33rd Annual IEEE Conference on Computational Complexity (CCC), pages 22:1--22:23, 2018.
[65]
[RS85] Ronald L. Rivest and Adi Shamir. Efficient factoring based on partial information. In Proc. Advances in cryptology (EUROCRYPT), pages 31--34. 1985.
[66]
[Sha81] Adi Shamir. On the generation of cryptographically strong pseudorandom sequences. In Automata, languages and programming (Akko, 1981), volume 115 of Lecture Notes in Comput. Sci., pages 544--550. 1981.
[67]
[Sip83] Michael Sipser. A complexity theoretic approach to randomness. In Proc. 15th Annual ACM Symposium on Theory of Computing (STOC), pages 330--335, 1983.
[68]
[STV01] Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2):236--266, 2001.
[69]
[SU05] Ronen Shaltiel and Christopher Umans. Simple extractors for all min-entropies and a new pseudorandom generator. Journal of the ACM, 52(2):172--216, 2005.
[70]
[SU07] Ronen Shaltiel and Christopher Umans. Low-end uniform hardness vs. randomness tradeoffs for AM. In Proc. 39th Annual ACM Symposium on Theory of Computing (STOC), pages 430--439, 2007.
[71]
[SV22] Ronen Shaltiel and Emanuele Viola. On hardness assumptions needed for "extreme high-end" PRGs and fast derandomization. In Proc. 13th Conference on Innovations in Theoretical Computer Science (ITCS), pages Art. No. 116, 17. 2022.
[72]
[SvM23] Nicollas Sdroievski and Dieter van Melkebeek. Instance-wise hardness versus randomness tradeoffs for arthur-merlin protocols. Electronic Colloquium on Computational Complexity: ECCC, 30:029, 2023.
[73]
[Tel22] Roei Tell. Quantified derandomization: how to find water in the ocean. Foundations and Trends® in Theoretical Computer Science, 15(1):Paper No 1, 125, 2022.
[74]
[TSZS06] Amnon Ta-Shma, David Zuckerman, and Shmuel Safra. Extractors from Reed-Muller codes. Journal of Computer and System Sciences, 72(5):786--812, 2006.
[75]
[TV07] Luca Trevisan and Salil P. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. Computational Complexity, 16(4):331--364, 2007.
[76]
[Uma03] Christopher Umans. Pseudo-random generators for all hardnesses. Journal of Computer and System Sciences, 67(2):419--440, 2003.
[77]
[Wig19] Avi Wigderson. Mathematics and computation: A theory revolutionizing technology and science. Princeton University Press, Princeton, NJ, 2019.
[78]
[Wil13] Ryan Williams. Improving exhaustive search implies superpolynomial lower bounds. SIAM Journal of Computing, 42(3):1218--1244, 2013.
[79]
[Wil16] Richard Ryan Williams. Strong ETH breaks with Merlin and Arthur: short noninteractive proofs of batch evaluation. In Proc. 31st Annual IEEE Conference on Computational Complexity (CCC), volume 50, pages 2:1--2:17, 2016.
[80]
[Yao82] Andrew C. Yao. Theory and application of trapdoor functions. In Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 80--91, 1982.
Recommendations
In a world of P=BPP
Studies in complexity and cryptographyWe show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization results). In particular, the main incarnation of this equivalence refers to ...
Guest column: inapproximability results via Long Code based PCPs
Summer has come again. And what better way is there to spend a summer than to relax on a sandy beach, on a mountain top, or at a park's picnic tables, and... think theory! Summer is a particularly good time to attack the big questions whose openness ...
On the Possibility of Basing Cryptography on
Advances in Cryptology – CRYPTO 2021AbstractLiu and Pass (FOCS’20) recently demonstrated an equivalence between the existence of one-way functions (OWFs) and mild average-case hardness of the time-bounded Kolmogorov complexity problem. In this work, we establish a similar equivalence but ...
Comments
Information & Contributors
Information
Published In
Copyright © 2023 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 June 2023
Published in SIGACT Volume 54, Issue 2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 213Total Downloads
- Downloads (Last 12 months)103
- Downloads (Last 6 weeks)15
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in