Results 1  10
of
1,348
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 2 (0 self)
 Add to MetaCart
on each input at most once. For obfuscation, we propose a notion that extends indistinguishability obfuscation to probabilistic circuits: It should be hard to distinguish between the obfuscations of any two circuits whose output distributions at each input are computationally indistinguishable, possibly
On the (im)possibility of obfuscating programs
 Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract

Cited by 341 (24 self)
 Add to MetaCart
Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic
Candidate indistinguishability obfuscation and functional encryption for all circuits
 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
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
Patchable Obfuscation
, 2015
"... In this work, we introduce patchable obfuscation: our notion adapts the notion of indistinguishability obfuscation (iO) to a very general setting where obfuscated software evolves over time. We model this broadly by considering software patches P as arbitrary Turing Machines that take as input the d ..."
Abstract
 Add to MetaCart
number of patches that can be adaptively chosen by an adversary. We show that subexponentially secure iO for circuits and subexponentially secure oneway functions imply patchable obfuscation; and we show that subexponentially secure iO for circuits, subexponentially secure oneway functions, and sub
obfuscating conjunctions
 of Lecture Notes in Computer Science
, 2013
"... We show how to securely obfuscate the class of conjunction functions (functions like f(x1,..., xn) = x1 ∧ ¬x4 ∧ ¬x6 ∧ · · · ∧ xn−2). Given any function in the class, we produce an obfuscated program which preserves the inputoutput functionality of the given function, but reveals nothing else. ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We show how to securely obfuscate the class of conjunction functions (functions like f(x1,..., xn) = x1 ∧ ¬x4 ∧ ¬x6 ∧ · · · ∧ xn−2). Given any function in the class, we produce an obfuscated program which preserves the inputoutput functionality of the given function, but reveals nothing else
DifferingInputs Obfuscation and Applications
, 2013
"... In this paper we study of the notion of differinginput obfuscation, introduced by Barak et al. (CRYPTO 2001, JACM 2012). For any two circuit C0 and C1, differinginput obfuscator diO guarantees that nonexistence of a adversary that can find find an input on which C0 and C1 differ implies that diO( ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
O(C0) and diO(C1) are computationally indistinguishable. We show many applications of this notion: We define the notion of differinginput obfuscator for Turing machines and give a construction for the same (without converting it to a circuit) with inputspecific running times. More specifically
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 36 (1 self)
 Add to MetaCart
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
Protecting Mobile Agents Against Malicious Hosts
, 1997
"... A key element of any mobile code based distributed system are the security mechanisms available to protect (a) the host against potentially hostile actions of a code fragment under execution and (b) the mobile code against tampering attempts by the executing host. Many techniques for the first ..."
Abstract

Cited by 323 (1 self)
 Add to MetaCart
signatures). There is an error in reasoning in the arguments supporting these beliefs which we are going to point out. In this paper we describe softwareonly approaches for providing computation privacy for mobile code in the important case that the mobile code fragment computes an algebraic circuit (a
On the impossibility of obfuscation with auxiliary input
 In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05
, 2005
"... Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how to obfuscate point functions, under various complexity assumptions. Thus, it would seem possible that most programs of in ..."
Abstract

Cited by 32 (2 self)
 Add to MetaCart
circuit, may have some additional a priori information. This is essentially the case of interest in any usage of obfuscation we can imagine. We prove that there exist many natural classes of functions that cannot be obfuscated w.r.t. auxiliary input, both when the auxiliary input is dependent
Virtual BlackBox Obfuscation for All Circuits via Generic Graded Encoding
"... We present a new generalpurpose obfuscator for all polynomialsize 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 blackbox functionality, and achieves virtual blackbox securit ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
We present a new generalpurpose obfuscator for all polynomialsize 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 blackbox functionality, and achieves virtual black
Results 1  10
of
1,348