Results 1 - 10 of 53

Candidate indistinguishability obfuscation and functional encryption for all circuits

by Sanjam Garg, Mariana Raykova, Craig Gentry, Amit Sahai, Shai Halevi, Brent Waters - In FOCS , 2013
"... In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C0 and C1 of similar size, the obfuscations of C0 and C1 should be computationally indistinguishable. In functional ..."
Abstract - Cited by 170 (37 self) - Add to MetaCart
of what they can each learn individually. We give constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits. We accomplish this goal in three steps: • We describe a candidate construction for indistinguishability obfuscation for NC 1 circuits

Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits

by Daniel J. Bernstein, Nadia Heninger, Tanja Lange, Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters , 2013
"... In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C0 and C1 of similar size, the obfuscations of C0 and C1 should be computationally indistinguishable. In functional ..."
Abstract - Add to MetaCart
of what they can each learn individually. We give constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits. We accomplish this goal in three steps: • We describe a candidate construction for indistinguishability obfuscation for NC1 circuits

Indistinguishability obfuscation from functional encryption. To appear

by Nir Bitansky, Vinod Vaikuntanathan - in Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (available at https://eprint.iacr.org/2014/163.pdf , 2015
"... Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. So far, candidate IO constructions were based on specific assumptions on algebraic objects called multi-linear graded encodings. We present a generic construction of i ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
range of applications of indistin-guishability obfuscation. As an application, we obtain a new candidate IO construction based on the functional encryption scheme of Garg, Gentry, Halevi, and Zhandry [Eprint 14] under their assumptions on multi-linear graded encodings. We also show that, under

Limits on the power of indistinguishability obfuscation and functional encryption

by Gilad Asharov, Gil Segev , 2015
"... Recent breakthroughs in cryptography have positioned indistinguishability obfuscation as a "central hub" for almost all known cryptographic tasks, and as an extremely powerful building block for new cryptographic tasks resolving long-standing and foundational open problems. However, constr ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
of Sahai and Waters (STOC '14) and its variants, as well as sub-exponential security assumptions. Within our framework we prove the rst negative results on the power of indistinguishability obfuscation and of the tightly related notion of functional encryption. Our results are as follows:

Indistinguishability Obfuscation: from Approximate to Exact

by Nir Bitansky, Vinod Vaikuntanathan , 2015
"... We show general transformations from subexponentially-secure approximate indistinguisha-bility obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1/2 + fraction of inputs on a certain samplable distribution, into exact indistinguishability obfuscation where the obfu ..."
Abstract - Add to MetaCart
the obfuscated circuit and the original circuit agree on all inputs. As a step towards our results, which is of independent interest, we also obtain an approximate-to-exact transformation for functional encryption. At the core of our techniques is a method for “fooling” the obfuscator into giving us the correct

Indistinguishability Obfuscation of Iterated Circuits and RAM programs

by Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan , 2014
"... A key source of inefficiency in existing obfuscation schemes is that they operate on programs repre-sented as Boolean circuits or (with stronger assumptions and costlier constructs) as Turing machines. We bring the complexity of obfuscation down to the level of RAM programs. That is, assuming inject ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
injective one way functions and indistinguishability obfuscators for all circuits, we construct indistin-guishability obfuscators for RAM programs with the following parameters, up to polylogarithmic factors and a multiplicative factor in the security parameter: (a) The space used by the obfuscated program

Indistinguishability Obfuscation from Functional Encryption for Simple Functions

by Prabhanjan Ananth, Abhishek Jain, Amit Sahai
"... We show how to construct indistinguishability obfuscation (iO) for circuits from any non-compact functional encryption (FE) scheme with sub-exponential security against un-bounded collusions. We accomplish this by giving a generic transformation from any such FE scheme into a compact FE scheme. By c ..."
Abstract - Add to MetaCart
We show how to construct indistinguishability obfuscation (iO) for circuits from any non-compact functional encryption (FE) scheme with sub-exponential security against un-bounded collusions. We accomplish this by giving a generic transformation from any such FE scheme into a compact FE scheme

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

by Zvika Brakerski, Guy N. Rothblum
"... We present a new general-purpose obfuscator for all polynomial-size circuits. The obfuscator uses graded encoding schemes, a generalization of multilinear maps. We prove that the obfuscator exposes no more information than the program’s black-box functionality, and achieves virtual black-box securit ..."
Abstract - Cited by 66 (1 self) - Add to MetaCart
We present a new general-purpose obfuscator for all polynomial-size circuits. The obfuscator uses graded encoding schemes, a generalization of multilinear maps. We prove that the obfuscator exposes no more information than the program’s black-box functionality, and achieves virtual black

Obfuscation of Probabilistic Circuits and Applications

by Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan
"... This paper studies the question of how to define, construct, and use obfuscators for probabilistic programs. Such obfuscators compile a possibly randomized program into a deterministic one, which achieves computationally indistinguishable behavior from the original program as long as it is run on ea ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
of one of our pIO variants from sub-exponentially hard indistinguishability obfuscation (for deterministic circuits) and one-way functions, and conjecture this construction to be a good candidate for other pIO variants. We then move on to show a number of applications of pIO: • We give a general

One-Way Functions and (Im)perfect Obfuscation

by Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
"... A program obfuscator takes a program and outputs an “scrambled” version of it, where the goal is that the obfuscated program will not reveal much about its structure beyond what is apparent from executing it. There are several ways of formalizing this goal. Specifically, in indistinguishability obfu ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
obfuscation, first defined by Barak et al. (CRYPTO 2001), the requirement is that the results of obfuscating any two functionally equivalent programs (circuits) will be computationally indistinguishable. Recently, a fascinating candidate construction for indistinguishability obfuscation was proposed by Garg
Results 1 - 10 of 53