[PDF] Top 20 Random-Oracle Uninstantiability from Indistinguishability Obfuscation

... Indistinguishability obfuscation for Turing machines has been constructed in the works of Boyle, Chung and Pass [BCP14] and Ananth et ...differing-inputs obfuscation (diO) which extends iO to ... See full document

... While a number of program families of interest are known to be VBB obfuscatable (under some strong hardness assumptions), e.g. [Can97, Wee05, BCKP14], no general-purpose VBB-obfuscators of all programs can exist. Indeed ... See full document

... of random TDPs. Even primitives that we do not know how to construct from TDPs in a black-box way ...the random TDP model ...constructed from DDH assumption in a black-box ...constructed ... See full document

... the random oracle ...point obfuscation and an extension he calls extensible testers—an extensible tester can be regarded as an obfuscation of a set of points Z which can be combined with a ... See full document

... of indistinguishability obfuscation, positioning it as a central hub for almost all known cryptographic tasks, and as an extremely powerful building block for new cryptographic tasks resolv- ing ... See full document

... Consider the (standard) PRAM model in which m CPUs have random access to a shared memory at m locations at each time step. An intuitive approach is to extend the construction of Ci O-RAM into the PRAM model, where ... See full document

... The next set of challenges deals with making the above plan to work with an obfuscation mechanism that only guarantees indistinguishability obfuscation. Here we follow the lead of Sahai and Waters ... See full document

... fresh random variables. The only requirement from this polynomial is that it must mimic noise which satisfies some mild statistical properties, as captured by the notion of ... See full document

... functionalities from graded encodings—in particular, “subring gen- eration”, and “subring sampling”, which require releasing additional “auxiliary elements” and thus challenges security (which is why a variant of ... See full document

... (succinct) indistinguishability obfuscation for Turing ...at random in applications), it transforms a Turing machine computation, M on input x (with time bound T ), into an encoding enc, which when ... See full document

... single-input obfuscation can be extended in a number of ways to an obfuscation that takes multiple ...the indistinguishability obfuscation of the circuit that has a puncturable PRF f ... See full document

... which indistinguishability obfuscation can be used as a building block has been insufficiently ...on indistinguishability obfuscation is based on that of Asharov and Segev [AS15] (which, in ... See full document

... Several random-oracle-like notions are defined in an “indistinguishability” ...information from the function, it is hard for the adversary to distinguish whether the information is obtained ... See full document

... candidate indistinguishability obfuscator, many researchers have studied the implications of in- distinguishability obfuscation as well as other obfuscation ...differing-inputs obfuscation [1, ... See full document

... derived from the message to allow for dedu- plication [BKR13], for example, in cloud storage ...the random oracle model derives the key for a message m as k ← RO(m) to then encrypt the message as c ← ... See full document

... the random oracle model, based on indistinguishability ...as indistinguishability obfuscation, and our proof involves the random oracle heuristic, we wish to emphasize ... See full document

... obfuscator from a circuit ...or obfuscation procedure will be proportional to |M |, while the evaluation will call the obfuscated program up to T ...of obfuscation where we can treat the obfuscated ... See full document

... schemes from just a single trusted ...the random oracle model based on indistinguishability obfus- cation; obtaining the first known construction of adaptively secure NIKE without complexity ... See full document

... Replacing exact IO with α-correct IO preserves two of the guarantees of the invariant signatures: 1) it is invariant in the sense that for every verification key VK and message M , C = VK(M ) can be opened to a unique ... See full document

... Instantiation: We show how to leverage PAFE for degree-5 arithmetic circuits to achieve iO, thus yielding the first iO construction from degree-5 multilinear maps. The crucial step in this transformation is to ... See full document