Browsing FAS Scholarly Articles by Keyword "complexity theory"
Now showing items 1-1 of 1
-
On the (Im)possibility of Obfuscating Programs
(Association for Computing Machinery (ACM), 2012)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 “unintelligible” in some ...