On the (Im)possibility of obfuscating programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2139 LNCS, Issue , 2001, Pages 1-18

  Barak, Boaz ^a   Goldreich, Oded ^a   Impagliazzo, Rusell ^b   Rudich, Steven ^c   Sahai, Amit ^d   Vadhan, Salil ^e   Yang, Ke ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Carnegie Mellon University   (United States)

^d Princeton University   (United States)

^e HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; POLYNOMIAL APPROXIMATION; PROGRAM COMPILERS; CRYPTOGRAPHY;

ENCRYPTION SCHEMES; HO-MOMORPHIC ENCRYPTIONS; IMPOSSIBILITY RESULTS; PSEUDO-RANDOM FUNCTIONS; RESTRICTED MODELS; SOFTWARE PROTECTION; THEORETIC APPLICATION; THEORETICAL INVESTIGATIONS;

CRYPTOGRAPHY; PROGRAM COMPILERS;

EID: 79251578513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44647-8_1     Document Type: Conference Paper

References (18)

1. 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.
2. 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.
3. Dan Boneh and Richard Lipton. Algorithms for black-box fields and their applications to cryptography. In M. Wiener, editor, Advances in Cryptology-CRYPTO '96, volume 1109 of Lecture Notes in Computer Science, pages 283-297. Springer-Verlag, August 1996.
4. 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-218, Dallas, 23-26 May 1998.
5. Christian Collberg and Clark Thomborson. Watermarking, tamper-proofing, and obfuscation - tools for software protection. Technical Report TR00-03, The Department of Computer Science, University of Arizona, February 2000.
6. Danny Dolev, Cynthia Dwork, and Moni Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391-437 (electronic), 2000.
7. Joan Feigenbaum and Michael Merritt, editors. Distributed computing and cryptography, Providence, RI, 1991. American Mathematical Society.
8. Amos Fiat and Adi Shamir. How to prove yourself: practical solutions to identification and signature problems. In Advances in cryptology-CRYPTO '86 (Santa Barbara, Calif., 1986), pages 186-194. Springer, Berlin, 1987.
9. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the Association for Computing Machinery, 33(4):792-807, 1986.
10. Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431-473, 1996.
11. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, April 1984.
12. Satoshi Hada. Zero-knowledge and code obfuscation. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT '2000, Lecture Notes in Computer Science, pages 443-457, Kyoto, Japan, 2000. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany.
13. 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-254, Portland, OR, May 2000. ACM.
14. David Naccache, Adi Shamir, and Julien P. Stern. How to copyright a function? In H. Imai and Y. Zheng, editors, Public Key Cryptography-PKC '99, volume 1560 of Lecture Notes in Computer Science, pages 188-196. Springer-Verlag, March 1999.
15. Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions. In 38th Annual Symposium on Foundations of Computer Science, pages 458-467, Miami Beach, Florida, 20-22 October 1997. IEEE.
16. 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-179. Academic, New York, 1978.
17. 1. In 40th Annual Symposium on Foundations of Computer Science, pages 554-566, New York, NY, 17-19 October 1999. IEEE.
18. Frans van Dorsselaer. Obsolescent feature. Winning entry for the 1998 International Obfuscated C Code Contest, 1998. http://www.ioccc.org/.