Results 1  10
of
51
There is no Indistinguishability Obfuscation in Pessiland
, 2013
"... We show that if NP � co−RP then the existence of efficient indistinguishability obfuscation (iO) implies the existence of oneway functions. Thus, if we live in “Pessiland”, where NP problems are hard on the average but oneway 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 oneway functions. Thus, if we live in “Pessiland”, where NP problems are hard on the average but oneway functions do not exist, or even in “Heuristica”, where NP problems
Indistinguishability Obfuscation versus MultiBit Point Obfuscation with Auxiliary Input
"... Abstract. In a recent celebrated breakthrough, Garg et al. (FOCS 2013) gave the first candidate for socalled indistinguishability obfuscation (iO) thereby reviving the interest in obfuscation for a general purpose. Since then, iO has been used to advance numerous subareas of cryptography. While in ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
is point obfuscation with auxiliary input (AIPO), which allows an adversary to learn some nontrivial auxiliary information about the obfuscated point α (Goldwasser, TaumanKalai; FOCS, 2005). Multibit point functions are a strengthening of point functions, where on α, the point function returns a string
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
"... In this work, we show how to use indistinguishability obfuscation (iO) to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing. Our schemes enjoy several interesting properties that have not been achievable before: • Our multiparty noninteractive key exchange ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
In this work, we show how to use indistinguishability obfuscation (iO) to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing. Our schemes enjoy several interesting properties that have not been achievable before: • Our multiparty noninteractive key
Computationtrace indistinguishability obfuscation and its applications
, 2015
"... We introduce a new, instancebased notion of indistinguishability obfuscation, called computationtrace indistinguishability obfuscation (CiO), for (parallel) RAM computation. CiO only obfuscates a fixed, single computation instance, as opposed to iO which obfuscates a function on all input instance ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We introduce a new, instancebased notion of indistinguishability obfuscation, called computationtrace indistinguishability obfuscation (CiO), for (parallel) RAM computation. CiO only obfuscates a fixed, single computation instance, as opposed to iO which obfuscates a function on all input
Indistinguishability Obfuscation of Iterated Circuits and RAM programs
, 2014
"... A key source of inefficiency in existing obfuscation schemes is that they operate on programs represented 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
is proportional to the number of potential inputs for the RAM program. Our construction can be plugged into practically any existing use of indistinguishability obfuscation, such as delegation of computation, functional encryption, noninteractive zeroknowledge, and multiparty computation protocols, resulting
Adaptively Secure Twoparty Computation From Indistinguishability Obfuscation
, 2014
"... We present the first tworound, twoparty general function evaluation protocol that is secure against honestbutcurious adaptive corruption of both parties. In addition, the protocol is incoercible for one of the parties, and fully leakage tolerant. It requires a global (nonprogrammable) reference ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
programmable) reference string and is based on one way functions and generalpurpose indistinguishability obfuscation with subexponential security, as well as augmented noncommitting encryption. A Byzantine version of the protocol, obtained by applying the Canetti et al. [STOC 02] compiler, achieves UC security
Positive results and techniques for obfuscation
 In EUROCRYPT ’04
, 2004
"... Abstract. Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P) protects any secrets that may be built into and used by P. Program obfuscation, if possible, would have numerous im ..."
Abstract

Cited by 40 (1 self)
 Add to MetaCart
focus on the goal of access control, and give several provable obfuscations for complex access control functionalities, in the random oracle model. Our results are obtained through nontrivial compositions of obfuscations; we note that general composition of obfuscations is impossible, and so developing
Obfuscation of Probabilistic Circuits and Applications
"... 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
in presence of some auxiliary input. We call the resulting notion probabilistic indistinguishability obfuscation (pIO). We define several variants of pIO, using different approaches to formalizing the above security requirement, and study nontrivial relations among them. Moreover, we give a construction
Survey on Cryptographic Obfuscation
, 2015
"... The recent result of Garg et al. (FOCS 2013) changed the previously pessimistic attitude towards general purpose cryptographic obfuscation. Since their first candidate construction, several authors proposed newer and newer schemes with more persuasive security arguments and better efficiency. At th ..."
Abstract
 Add to MetaCart
The recent result of Garg et al. (FOCS 2013) changed the previously pessimistic attitude towards general purpose cryptographic obfuscation. Since their first candidate construction, several authors proposed newer and newer schemes with more persuasive security arguments and better efficiency
On Extractability (a.k.a. DifferingInputs) Obfuscation
, 2014
"... We initiate the study of extractability obfuscation (a.k.a. differinginputs obfuscation), a notion first suggested by Barak et al. (JACM 2012): An extractability obfuscator eO for a class of algorithmsM guarantees that if an efficient attacker A can distinguish between obfuscations eO(M1), eO(M2) o ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
the blueprint of Garg et al. (FOCS 2013), we show how to bootstrap the obfuscator for NC1 to an obfuscator for all nonuniform polynomialtime Turing machines. In contrast to the construction of Garg et al., which relies on indistinguishability obfuscation for NC1, our construction enables succinctly
Results 1  10
of
51