Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, Ke Yang  Home/Search
Context Related
| iacr.org/2001/069.ps.gz cmu.edu/user/rudich/ww...obfuscators.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/search...ast=365&title=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Informally, an obfuscator O is an (ecient, probabilistic) \compiler" that takes as input a program (or circuit) P and produces a new program O(P ) that has the same functionality as P yet is \unintelligible" in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic and complexity-theoretic applications, ranging from software protection to homomorphic encryption to complexity-theoretic analogues of Rice's theorem. Most of these applications are based on an... (Update)
Cited by: More
On Obfuscating Point Functions - Wee (2005) (Correct)
HIDE: Hardware-support for Leakage-Immune Dynamic Execution - Zhuang, Zhang, Pande, Lee (2003) (Correct)
Secure Multi-Agent Computations - Endsuleit, Mie (2003) (Correct)
Similar documents (at the sentence level):
63.5%: On the (Im)possibility of Obfuscating Programs - Barak, Goldreich.. (2001) (Correct)
37.3%: On the (Im)possibility of Obfuscating Programs.. - Barak, Goldreich.. (2001) (Correct)
Active bibliography (related documents): More All
0.5: An Information-Theoretic Model for Steganography - Cachin (2001) (Correct)
0.3: Watermarking, Tamper-Proofing, and Obfuscation - Tools for.. - Collberg, al. (2002) (Correct)
0.3: Watermarking and Copyright Protection - Rauhala (2000) (Correct)
Similar documents based on text: More All
1.3: General Method of Program Code Obfuscation - Wroblewski (2002) (Correct)
0.4: Positive Results and Techniques for Obfuscation - Lynn, Prabhakaran, Sahai (2004) (Correct)
0.4: Attacking an Obfuscated Cipher By Injecting Faults - Jacob, Boneh, Felten (Correct)
Related documents from co-citation: More All
2: Software Protection and Simulation on Oblivious RAMs - Goldreich, Ostrovsky - 1996
BibTeX entry: (Update)
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. P. Vadhan, and K. Yang, "On the (im)possibility of obfuscating programs," in Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology (CRYPTO '01), J. Kilian, Ed. Santa Barbara, California: Springer-Verlag, Aug. 19-23 2001, pp. 1--18. http://citeseer.ist.psu.edu/article/barak01impossibility.html More
@misc{ barak-impossibility,
author = "Boaz Barak and Oded Goldreich and Russell Impagliazzo and Steven Rudich
and Amit Sahai and Salil Vadhan and Ke Yang",
title = "On the (Im)possibility of Obfuscating Programs",
year="2001",
url = "citeseer.ist.psu.edu/article/barak01impossibility.html",
url = "citeseer.nj.nec.com/barak01impossibility.html" }
Citations (may not include all citations):659 Random oracles are practical: A paradigm for designing ecien.. - Bellare, Rogaway - 1993
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Racko - 1988
167 The random oracle methodology (context) - Canetti, Goldreich et al. - 1998
90 A pseudorandom generator from any one-way function - astad, Impagliazzo et al. - 1999
90 IEEE Transactions on Information Theory (context) - Die, Hellman et al. - 1976
79 One-way functions are essential for complexity based cryptog.. (context) - Impagliazzo, Luby - 1989
65 Number-theoretic constructions of ecient pseudorandom functi.. - Naor, Reingold - 1997
61 The complexity of promise problems with applications to publ.. (context) - Even, Selman et al. - 1984
57 Software protection and simulation on oblivious RAMs - Goldreich, Ostrovsky - 1996
49 possibility of obfuscating programs (context) - Barak, Goldreich et al. - 2001
35 Non-interactive cryptocomputing for NC - Sander, Young et al. - 1999
32 Complete characterization of security notions for private-ke.. (context) - Katz, Yung - 2000
27 A complete promise problem for statistical zeroknowledge - Sahai, Vadhan - 1997
18 Perfectly one-way probabilistic hash functions - Canetti, Micciancio et al. - 1998
12 Algorithms for black-box elds and their applications to cryp.. (context) - Boneh, Lipton - 1996
8 Can statistical zero-knowledge be made non-interactive - Goldreich, Sahai et al. - 1999
8 and Moni Naor (context) - Dolev, Dwork - 2000
8 Lower bounds on the eciency of generic cryptographic constru.. (context) - Gennaro, Trevisan - 2000
6 The Department of Computer Science (context) - Collberg, Thomborson et al. - 2000
6 How to copyright a function (context) - Naccache, Shamir et al. - 1999
6 Zero-knowledge and code obfuscation (context) - Hada - 2000
5 American Mathematical Society (context) - Feigenbaum, Merritt et al. - 1991
3 Robustness and security of digital watermarks - Matheson, Mitchell et al. - 1998
2 Information hiding | a survey (context) - Petitcolas, Anderson et al. - 1999
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001) (Correct)
On the Complexity of Matsui's Attack - Junod (2001) (Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC