Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
"IO" is an acronym for "Indistinguishability obfuscation". Informally, obfuscating a program is the process of concealing what the program is doing while at the same time preserving its functionality. Among other things this serves to protect against code tampering and reverse engineering.
10
votes
1
answer
172
views
How inefficient are current Indistinguishability Obfuscation (IO) candidates?
Since last year, IO finally seems to be within our reach. … Let's say we want to obfuscate some Boolean circuit $C$ of size $n$, what's the magnitude of $|iO(C)|$ in Landau notation (if we take $n$ to be the security parameter)? …