Learn More
In this paper, we consider the question of determining whether a function <italic>f</italic> has property P or is &#949;-far from any function with property P. A <italic>property testing</italic> algorithm is given a sample of the value of <italic>f</italic> on instances drawn according to some distribution. In some cases, it is also allowed to query(More)
Informally, an <i>obfuscator</i> <i>O</i> is an (efficient, probabilistic) &#8220;compiler&#8221; that takes as input a program (or circuit) <i>P</i> and produces a new program <i>O</i>(<i>P</i>) that has the same functionality as <i>P</i> yet is &#8220;unintelligible&#8221; in some sense. Obfuscators, if they exist, would have a wide variety of(More)
Software protection is one of the most important issues concerning computer practice. There exist many heuristics and ad-hoc methods for protection, but the problem as a whole has not received the theoretical treatment it deserves. In this paper, we make the first steps towards a theoretic treatment of software protection: First, we distill and formulate(More)