{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:49:46Z","timestamp":1778215786611,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_1","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"1-18","source":"Crossref","is-referenced-by-count":700,"title":["On the (Im)possibility of Obfuscating Programs"],"prefix":"10.1007","author":[{"given":"Boaz","family":"Barak","sequence":"first","affiliation":[]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[]},{"given":"Rusell","family":"Impagliazzo","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Rudich","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Salil","family":"Vadhan","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. Technical report, Electronic Colloquium on Computational Complexity, 2001. http:\/\/www.eccc.uni-trier.de\/eccc .","DOI":"10.1007\/3-540-44647-8_1"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the First Annual Conference on Computer and Communications Security. ACM, November 1993.","DOI":"10.1145\/168588.168596"},{"key":"1_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 96","author":"D. Boneh","year":"1996","unstructured":"Dan Boneh and Richard Lipton. Algorithms for black-box fields and their applications to cryptography. In M. Wiener, editor, Advances in Cryptology\u2014CRYPTO\u2019 96, volume 1109 of Lecture Notes in Computer Science, pages 283\u2013297. Springer-Verlag, August 1996."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Oded Goldreich, and Shai Halevi. The random oracle methodology, revisited. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 209\u2013218, Dallas, 23\u201326 May 1998.","DOI":"10.1145\/276698.276741"},{"key":"1_CR5","unstructured":"Christian Collberg and Clark Thomborson. Watermarking, tamperproofing, and obfuscation-tools for software protection. Technical Report TR00-03, The Department of Computer Science, University of Arizona, February 2000."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Danny Dolev, Cynthia Dwork, and Moni Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391\u2013437 (electronic), 2000.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Joan Feigenbaum and Michael Merritt, editors. Distributed computing and cryptography, Providence, RI, 1991. American Mathematical Society.","DOI":"10.1090\/dimacs\/002"},{"key":"1_CR8","first-page":"186","volume-title":"Advances in cryptology\u2014 CRYPTO\u2019 86","author":"A. Fiat","year":"1986","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in cryptology\u2014 CRYPTO\u2019 86 (Santa Barbara, Calif., 1986), pages 186\u2013194. Springer, Berlin, 1987."},{"issue":"4","key":"1_CR9","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4):792\u2013807, 1986.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431\u2013473, 1996.","journal-title":"Journal of the ACM"},{"issue":"2","key":"1_CR11","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"Shafi Goldwasser and Silvio Micali. Probabilistic encryption","year":"1984","unstructured":"Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270\u2013299, April 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-44448-3_34","volume-title":"Advances in Cryptology-ASIACRYPT\u2019 2000","author":"S. Hada","year":"2000","unstructured":"Satoshi Hada. Zero-knowledge and code obfuscation. In T. Okamoto, editor, Advances in Cryptology-ASIACRYPT\u2019 2000, Lecture Notes in Computer Science, pages 443\u2013457, Kyoto, Japan, 2000. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Jonathan Katz and Moti Yung. Complete characterization of security notions for private-key encryption. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 245\u2013254, Portland, OR, May 2000. ACM.","DOI":"10.1145\/335305.335335"},{"key":"1_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-49162-7_14","volume-title":"Public Key Cryptography\u2014 PKC\u2019 99","author":"D. Naccache","year":"1999","unstructured":"David Naccache, Adi Shamir, and Julien P. Stern. How to copyright a function? In H. Imai and Y. Zheng, editors, Public Key Cryptography\u2014 PKC\u2019 99, volume 1560 of Lecture Notes in Computer Science, pages 188\u2013196. Springer-Verlag, March 1999."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, pages 458\u2013467, Miami Beach, Florida, 20-22 October 1997. IEEE.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"1_CR16","first-page":"169","volume-title":"Foundations of secure computation (Workshop, Georgia Inst. Tech., Atlanta, Ga., 1977)","author":"R. L. Rivest","year":"1978","unstructured":"Ronald L. Rivest, Len Adleman, and Michael L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of secure computation (Workshop, Georgia Inst. Tech., Atlanta, Ga., 1977), pages 169\u2013179. Academic, New York, 1978."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Thomas Sander, Adam Young, and Moti Yung. Non-interactive cryptocomputing for NC1. In 40th Annual Symposium on Foundations of Computer Science, pages 554\u2013566, New York, NY, 17-19 October 1999. IEEE.","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"1_CR18","unstructured":"Frans van Dorsselaer. Obsolescent feature. Winning entry for the 1998 International Obfuscated C Code Contest, 1998. http:\/\/www.ioccc.org\/ ."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:08:42Z","timestamp":1737533322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}