Hot answers tagged

10

I provide a summary below of what is currently known (to my knowledge) regarding obfuscation of various class of "mostly-zero" functions. From Indistinguishability Obfuscation What we can obfuscate: all efficient functions Which notion of security: indistinguishability obfuscation Underlying assumptions: new, exotic, and relatively poorly understood ...


8

Program Obfuscation is a method to scramble the program code such that it becomes unintelligible but preserves the program's functionality. The notion of indistinguishability obfuscation was proposed in [BGI+01]. Actually they first consider another notion which is called virtual black box obfuscation (VBB Obfuscation). However, they showed that VBB ...


4

From InfoSec SE This Security.SE answer should be read before the answer posted here. The following block quote and FPS example are taken from the answer linked. Functional encryption is about providing a computable circuit (obfuscated with IO) which receives as input encrypted versions of some value x, and returns F(x) for some function F, without ...


3

An efficiently computable function $f:\{0,1\}^*\rightarrow\{0,1\}^*$ is said to be $(s,\epsilon)$-one-way if for every adversary $\mathsf{A}$ of size* at most $s=s(|x|)$ the probability $\Pr\left[{\mathsf{A}(f(x))\in f^{-1}(x)}\right]$ is at most $\epsilon=\epsilon(|x|)$, where the probability is over uniform distribution on the domain and the random coins ...


2

Since noone has written down an answer, I'll give it a go. There are two important parts of your (or of any) security definitions: An adversary $\mathcal{A}$, with bounded computational power; A bound ${\tt negl}(x)$ on the advantage of $\mathcal{A}$. These lead to two important observations: The more power we give $\mathcal{A}$, the stronger our ...


Only top voted, non community-wiki answers of a minimum length are eligible