Next: Three Theorems regarding Testing
Up: Back at Weizmann (1998-2003)
Previous: On the Security of
Informally, an obfuscator is an (efficient, probabilistic)
``compiler'' that takes as input a program P
and produces a new program Obf(P)
that has the same functionality as P
yet is ``unintelligible'' in some sense.
The main result of this work is that, even under very
weak formalizations of the above notion,
obfuscation is impossible.
Comments:
Authored by B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich,
A. Sahai, S. Vadhan and K. Yang. Appeared in
- Proceedings of Crypto01, pages 1-18.
Oded Goldreich
2003-07-30