[PDF] Top 20 Indistinguishability Obfuscation from Compact Functional Encryption

... program obfuscation remained an elusive goal for several decades, this changed recently with the seminal work of Garg et ...of indistinguishability obfuscation [BGI + 01] (iO) for ...deniable ... See full document

... authenticated encryption approach discussed in the previous section: when embedding the encrypted recipient set in the broadcast ciphertext we also embed a MAC of the encrypted ...follows from security of ... See full document

... an encryption scheme as Delegatable Functional Encryption ...generated from a PRF applied on ...in obfuscation based FE schemes, delegation could have been done by re-obfuscating the ... See full document

... We note that there are multiple ways to obtain a generalized matrix branching program from a circuit, or from a time-bounded Turing machine or RAM. Barrington’s theorem [Bar86] shows how to convert a ... See full document

... deniable encryption scheme for the ...an obfuscation that takes as input encryptions of inputs of all the parties and computes the desired functionality on their ...with functional encryption ... See full document

... iO from bilinear maps, LWE and weak pseudorandom objects, which they term Pseudo Flawed-smudging Generators ...the functional computation into a deep public computation and a shallow private computation, ... See full document

... starting from Π ˜ that switches the program from P to P 0 time step by time ...guarantee functional equivalence as forgeries exist ...switch from P to P 0 at time step t using iO ... See full document

... indistinguishable from a random strings (rather than from encryption of random ...suffer from uninstantiability ...assuming indistinguishability obfuscation for Turing machines ... See full document

... witness encryption [GGSW13] on exponential hardness of some simple as- sumptions over multinear encodings—the “multilinear subgroup eliminations assumption” and the “multilinear subgroup decision assumption” ... See full document

... construct from TDPs in a black-box way (e.g., CCA secure public key encryption) are known to exist in the random TDP model ...constructed from DDH assumption in a black-box ...constructed from ... 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

... point obfuscation, that is, virtual black-box and virtual ...public-key encryption schemes from an IND-CPA secure encryption scheme using MB-AIPO with computationally hard-to-invert auxiliary ... See full document

... participants from external author- itative (or otherwise coercive) entities that try to entice a party to reveal its state ...construction from any deniable encryption scheme [CDNO97, SW14] is ... See full document

... machines. Functional Encryption and Obfuscation are not just powerful cryptographic primitives in their own right, but are also intimately related objects – for example, it was shown in [10] that ... See full document

... pa-iO from single-program ...transformation from single-program pa-iO to multi-program pa-iO is, however, different from the sequential setting to enable this ...employ functional ... See full document

... Program obfuscation has been a longstanding goal in cryptography, though for many years general solutions seemed ...eral indistinguishability obfuscation (iO) candidate by Garg, Gentry, Halevi, ... See full document

... Here, we specifically highlight the recent work of Asharov et al. [AJLA + 12], which achieves 3-round MPC in the CRS model (and 2-round MPC in the PKI model) against static malicious adversaries. They use fully ... See full document

... transformation from IPE with weak function hid- ing to IPE with full function ...starts from the ABDP public key IPE scheme, whose secret key for a vector y reveals y and its inner product with the master ... See full document

... secure indistinguishability obfuscation (iO, a very strong but generic assumption), a perfectly correct additively homomorphic encryption scheme for addition modulo a given prime, and a ... See full document

... probabilistic indistinguishability obfuscation scheme [CLTV15], a perfectly correct fully homomorphic encryption (FHE), a dual-mode non-interactive zero-knowledge proof systems, and a language with ... See full document