| | On the (Im)possibility of Obfuscating Programs (Site not responding. Last check: 2007-09-17) |
 | | Informally, an obfuscator O is an (efficient, 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 ``unreadable'' 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. |
 | | We extend our impossibility result in a number of ways, including even obfuscators that (a) are not necessarily computable in polynomial time, (b) only approximately preserve the functionality, and (c) only need to work for very restricted models of computation TC0). |
| www.wisdom.weizmann.ac.il /~oded/p_obfuscate.html (220 words) |