Results 1 - 10 of 6,534

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 169 (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 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

There is no Indistinguishability Obfuscation in Pessiland

by Tal Moran, Alon Rosen , 2013
"... We show that if NP � co−RP then the existence of efficient indistinguishability obfuscation (iO) implies the existence of one-way functions. Thus, if we live in “Pessiland”, where NP problems are hard on the average but one-way functions do not exist, or even in “Heuristica”, where NP problems are h ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
We show that if NP � co−RP then the existence of efficient indistinguishability obfuscation (iO) implies the existence of one-way functions. Thus, if we live in “Pessiland”, where NP problems are hard on the average but one-way functions do not exist, or even in “Heuristica”, where NP problems

Idea: Benchmarking Indistinguishability Obfuscation – A candidate implementation

by Sebastian Banescu, Nils Kunze, Er Pretschner
"... Abstract. We present the results of preliminary experiments imple-menting the Candidate Indistinguishability Obfuscation algorithm re-cently proposed by Garg et al. [1]. We show how different parameters of the input circuits impact the performance and the size of the obfuscated programs. On the nega ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. We present the results of preliminary experiments imple-menting the Candidate Indistinguishability Obfuscation algorithm re-cently proposed by Garg et al. [1]. We show how different parameters of the input circuits impact the performance and the size of the obfuscated programs

Indistinguishability Obfuscation: from Approximate to Exact∗

by Nir Bitansky, Vinod Vaikuntanathan
"... 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. 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

Indistinguishability Obfuscation with Constant Size Overhead

by Prabhanjan Ananth, Abhishek Jain, Amit Sahai , 2015
"... Present constructions of indistinguishability obfuscation (iO) create obfuscated programs where the size of the obfuscated program is at least a factor of a security parameter larger than the size of the original program. In this work, we construct the first iO scheme that achieves only a constant m ..."
Abstract - Add to MetaCart
Present constructions of indistinguishability obfuscation (iO) create obfuscated programs where the size of the obfuscated program is at least a factor of a security parameter larger than the size of the original program. In this work, we construct the first iO scheme that achieves only a constant

Using Indistinguishability Obfuscation via UCEs

by Christina Brzuska, Arno Mittelbach
"... Abstract. We provide the first standard model construction for a powerful class of Universal Computational Extractors (UCEs; Bellare et al. Crypto 2013) based on indistinguishability obfuscation. Our construction suffices to instantiate correlation-secure hash functions and universal one-way functio ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract. We provide the first standard model construction for a powerful class of Universal Computational Extractors (UCEs; Bellare et al. Crypto 2013) based on indistinguishability obfuscation. Our construction suffices to instantiate correlation-secure hash functions and universal one
Results 1 - 10 of 6,534