On the (im)possibility of obfuscating programs.

Steven Rudich Carnegie Mellon University, Pittsburgh, USA Gödel Prize http://www.cs.cmu.edu/~rudich/ https://scholar.google.com/citations?user=qLuAbhMAAAAJ https://dl.acm.org/profile/81100002010 https://en.wikipedia.org/wiki/Steven_Rudich https://www.linkedin.com/in/steven-rudich-86814451 https://www.wikidata.org/entity/Q93146 https://www.researchgate.net/profile/Steven_Rudich https://id.loc.gov/authorities/names/n90683634 https://d-nb.info/gnd/173723675 http://www.andrej.com/mathematicians/R/Rudich_Steven.html https://mathgenealogy.org/id.php?id=50082

Boaz Barak Oded Goldreich 0001 Russell Impagliazzo Steven Rudich Amit Sahai Salil P. Vadhan Ke Yang 0005 On the (im)possibility of obfuscating programs. 6:1-6:48 2012 59 J. ACM 2 https://doi.org/10.1145/2160158.2160159 db/journals/jacm/jacm59.html#BarakGIRSVY12

Noga Alon Richard Beigel Simon Kasif Steven Rudich Benny Sudakov Learning a Hidden Matching. 487-501 2004 33 SIAM J. Comput. 2 https://doi.org/10.1137/S0097539702420139 db/journals/siamcomp/siamcomp33.html#AlonBKRS04

Steven Rudich Complexity theory: From Gödel to Feynman. 5-87 2004 Computational Complexity Theory https://doi.org/10.1090/pcms/010/02 books/ams/04/RW2004 db/books/collections/RW2004.html#Rudich04 Steven Rudich Avi Wigderson Computational Complexity Theory. AMS Chelsea Publishing 2004 IAS / Park City mathematics series 10 978-0-8218-2872-4 https://doi.org/10.1090/pcms/010 db/books/collections/RW2004.html Noga Alon Richard Beigel Simon Kasif Steven Rudich Benny Sudakov Learning a Hidden Matching. 197- 2002 conf/focs/2002 FOCS https://doi.org/10.1109/SFCS.2002.1181943 https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181943 db/conf/focs/focs2002.html#AlonBKRS02

Manindra Agrawal Eric Allender Russell Impagliazzo Toniann Pitassi Steven Rudich Reducing the complexity of reductions. 117-138 2001 10 Comput. Complex. 2 https://doi.org/10.1007/s00037-001-8191-1 https://www.wikidata.org/entity/Q57311713 db/journals/cc/cc10.html#AgrawalAIPR01

Jeff Edmonds Russell Impagliazzo Steven Rudich Jirí Sgall Communication complexity towards lower bounds on circuit depth. 210-246 2001 10 Comput. Complex. 3 https://doi.org/10.1007/s00037-001-8195-x db/journals/cc/cc10.html#EdmondsIRS01

Boaz Barak Oded Goldreich 0001 Russell Impagliazzo Steven Rudich Amit Sahai Salil P. Vadhan Ke Yang 0005 On the (Im)possibility of Obfuscating Programs. 1-18 2001 conf/crypto/2001 CRYPTO https://doi.org/10.1007/3-540-44647-8_1 db/conf/crypto/crypto2001.html#BarakGIRSVY01

Boaz Barak Oded Goldreich 0001 Russell Impagliazzo Steven Rudich Amit Sahai Salil P. Vadhan Ke Yang 0005 On the (Im)possibility of Obfuscating Programs Electron. Colloquium Comput. Complex. 2001 TR01 TR01-057 db/journals/eccc/eccc8.html#ECCC-TR01-057 https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-057/index.html

Boaz Barak Oded Goldreich 0001 Russell Impagliazzo Steven Rudich Amit Sahai Salil P. Vadhan Ke Yang 0005 On the (Im)possibility of Obfuscating Programs. 69 2001 2001 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2001/069 db/journals/iacr/iacr2001.html#BarakGIRSVY01

Noam Nisan Steven Rudich Michael E. Saks Products and Help Bits in Decision Trees. 1035-1050 1999 28 SIAM J. Comput. 3 db/journals/siamcomp/siamcomp28.html#NisanRS99 https://doi.org/10.1137/S0097539795282444

Manindra Agrawal Eric Allender Steven Rudich Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. 127-143 1998 57 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss57.html#AgrawalAR98 https://doi.org/10.1006/jcss.1998.1583 https://www.wikidata.org/entity/Q56610693

Alexander A. Razborov Steven Rudich Natural Proofs. 24-35 1997 55 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss55.html#RazborovR97 https://doi.org/10.1006/jcss.1997.1494 https://www.wikidata.org/entity/Q55878547

Steven Rudich Super-bits, Demi-bits, and NP/qpoly-natural Proofs. 85-93 1997 conf/random/1997 RANDOM db/conf/random/random1997.html#Rudich97 https://doi.org/10.1007/3-540-63248-4_8 Manindra Agrawal Eric Allender Russell Impagliazzo Toniann Pitassi Steven Rudich Reducing the Complexity of Reductions. 730-738 1997 conf/stoc/1997 STOC https://doi.org/10.1145/258533.258671 https://www.wikidata.org/entity/Q56610692 db/conf/stoc/stoc1997.html#AgrawalAIPR97

Michael J. Fischer Shlomo Moran Steven Rudich Gadi Taubenfeld The Wakeup Problem. 1331-1332 1996 25 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp25.html#FischerMRT96 https://doi.org/10.1137/S0097539793254959

Eric Allender Joan Feigenbaum Judy Goldsmith Toniann Pitassi Steven Rudich The future of computational complexity theory: part II. 3-7 1996 27 SIGACT News 4 https://doi.org/10.1145/242581.242582 db/journals/sigact/sigact27.html#AllenderFGPR96

Avrim Blum Steven Rudich Fast Learning of k-Term DNF Formulas with Queries. 367-373 1995 51 J. Comput. Syst. Sci. 3 db/journals/jcss/jcss51.html#BlumR95 https://doi.org/10.1006/jcss.1995.1075

David A. Mix Barrington Richard Beigel Steven Rudich Representing Boolean Functions as Polynomials Modulo Composite Numbers. 367-382 1994 4 Comput. Complex. db/journals/cc/cc4.html#BarringtonBR94 https://doi.org/10.1007/BF01263424

James Aspnes Richard Beigel Merrick L. Furst Steven Rudich The Expressive Power of Voting Polynomials. 135-148 1994 14 Comb. 2 db/journals/combinatorica/combinatorica14.html#AspnesBFR94 https://doi.org/10.1007/BF01215346

Products and Help Bits in Decision Trees Noam Nisan Steven Rudich Michael E. Saks 318-329 conf/focs/FOCS35 1994 FOCS db/conf/focs/focs94.html#NisanRS94 https://doi.org/10.1109/SFCS.1994.365683 https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365683 Alexander A. Razborov Steven Rudich Natural proofs. 204-213 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195134 https://www.wikidata.org/entity/Q56701135 db/conf/stoc/stoc1994.html#RazborovR94 Avrim Blum Merrick L. Furst Jeffrey C. Jackson Michael J. Kearns Yishay Mansour Steven Rudich Weakly learning DNF and characterizing statistical query learning using Fourier analysis. 253-262 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195147 db/conf/stoc/stoc1994.html#BlumFJKMR94

Alexander A. Razborov Steven Rudich Natural Proofs Electron. Colloquium Comput. Complex. 1994 TR94 TR94-010 db/journals/eccc/eccc1.html#ECCC-TR94-010 https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-010/index.html

On Dice and Coins: Models of Computation for Random Generation David Feldman Russell Impagliazzo Moni Naor Noam Nisan Steven Rudich Adi Shamir 159-174 Inf. Comput. June 1993 104 2 db/journals/iandc/iandc104.html#FeldmanINNRS93 https://doi.org/10.1006/inco.1993.1028

Sampath Kannan Moni Naor Steven Rudich Implicit Representation of Graphs. 596-603 1992 5 SIAM J. Discret. Math. 4 db/journals/siamdm/siamdm5.html#KannanNR92 https://doi.org/10.1137/0405049 https://www.wikidata.org/entity/Q56504575

Fast Learning of k-Term DNF Formulas with Queries Avrim Blum Steven Rudich 382-389 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#BlumR92 https://doi.org/10.1145/129712.129748 Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) David A. Mix Barrington Richard Beigel Steven Rudich 455-461 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#BarringtonBR92 https://doi.org/10.1145/129712.129756 Steven Rudich The Use of Interaction in Public Cryptosystems (Extended Abstract). 242-251 https://doi.org/10.1007/3-540-46766-1_19 1991 conf/crypto/1991 CRYPTO db/conf/crypto/crypto91.html#Rudich91 Communication Complexity Towards Lower Bounds on Circuit Depth Jeff Edmonds Steven Rudich Russell Impagliazzo Jirí Sgall 249-257 conf/focs/FOCS32 1991 FOCS db/conf/focs/focs91.html#EdmondsRIS91 https://doi.org/10.1109/SFCS.1991.185375 https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185375 The Expressive Power of Voting Polynomials James Aspnes Richard Beigel Merrick L. Furst Steven Rudich 402-409 conf/stoc/STOC23 1991 STOC db/conf/stoc/stoc91.html#AspnesBFR91 https://doi.org/10.1145/103418.103461

Lane A. Hemachandra Steven Rudich On the Complexity of Ranking. 251-271 1990 41 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss41.html#HemachandraR90 https://doi.org/10.1016/0022-0000(90)90038-M

The Wakeup Problem (Extended Abstract) Michael J. Fischer Shlomo Moran Steven Rudich Gadi Taubenfeld 106-116 conf/stoc/STOC22 1990 STOC db/conf/stoc/stoc90.html#FischerMRT90 https://doi.org/10.1145/100216.100228 David Feldman Russell Impagliazzo Moni Naor Noam Nisan Steven Rudich Adi Shamir On Dice and Coins: Models of Computation for Random Generation. 319-340 1989 conf/icalp/1989 ICALP db/conf/icalp/icalp89.html#FeldmanINNRS89 https://doi.org/10.1007/BFb0035769 Limits on the Provable Consequences of One-Way Permutations Russell Impagliazzo Steven Rudich 44-61 conf/stoc/STOC21 1989 STOC db/conf/stoc/stoc89.html#ImpagliazzoR89 https://doi.org/10.1145/73007.73012 Russell Impagliazzo Steven Rudich Limits on the Provable Consequences of One-way Permutations. 8-26 https://doi.org/10.1007/0-387-34799-2_2 1988 conf/crypto/1988 CRYPTO db/conf/crypto/crypto88.html#ImpagliazzoR88 Steven Rudich Leonard Berman Optimal Circuits and Transitive Automorphism Groups. 516-524 1988 conf/icalp/1988 ICALP db/conf/icalp/icalp88.html#RudichB88 https://doi.org/10.1007/3-540-19488-6_138 Implicit Representation of Graphs Sampath Kannan Moni Naor Steven Rudich 334-343 conf/stoc/STOC20 1988 STOC db/conf/stoc/stoc88.html#KannanNR88 https://doi.org/10.1145/62212.62244 Inferring the Structure of a Markov Chain from its Output Steven Rudich 321-326 conf/focs/FOCS26 1985 FOCS db/conf/focs/focs85.html#Rudich85 https://doi.org/10.1109/SFCS.1985.34 https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.34 The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) Benny Chor Oded Goldreich 0001 Johan Håstad Joel Friedman Steven Rudich Roman Smolensky 396-407 conf/focs/FOCS26 1985 FOCS db/conf/focs/focs85.html#ChorGHFRS85 https://doi.org/10.1109/SFCS.1985.55 https://doi.ieeecomputersociety.org/10.1109/SFCS.1985.55 https://www.wikidata.org/entity/Q62870449 Manindra Agrawal Eric Allender Noga Alon James Aspnes Boaz Barak David A. Mix Barrington Richard Beigel Leonard Berman Avrim Blum Benny Chor Jeff Edmonds Joan Feigenbaum David Feldman Michael J. Fischer Joel Friedman Merrick L. Furst Oded Goldreich 0001 Judy Goldsmith Johan Håstad Lane A. HemaspaandraLane A. Hemachandra Russell Impagliazzo Jeffrey C. Jackson Sampath Kannan Simon Kasif Michael KearnsMichael J. Kearns Yishay Mansour Shlomo Moran Moni Naor Noam Nisan Toniann Pitassi Alexander A. Razborov Amit Sahai Michael E. Saks Jirí Sgall Adi Shamir Roman Smolensky Benny Sudakov Gadi Taubenfeld Salil P. Vadhan Avi Wigderson Ke Yang 0005