Public-Coin Differing-Inputs Obfuscator for Hiding-Input Point Function with Multi-bit Output and Its Applications
| Autor: | Hongda Li, Peifang Ni, Dongxue Pan, Bei Liang |
|---|---|
| Rok vydání: | 2019 |
| Předmět: | |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783030354220 INDOCRYPT |
| DOI: | 10.1007/978-3-030-35423-7_15 |
| Popis: | Differing-inputs obfuscation (diO), first introduced by Barak et al. (CRYPTO 2001) and then revisited by Ananth et al. (ePrint 2013) and Boyle et al. (TCC 2014), is a natural extension of indistinguishability obfuscation (iO), which captures a security notion that the obfuscations of two efficiently generated programs \(C_0\) and \(C_1\) are indistinguishable if it is hard for an adversary to find an input x such that \(C_0(x)\ne C_1(x)\), even in the presence of auxiliary information aux that is generated together with \(C_0\) and \(C_1\). A variant notion of diO, called public-coin diO, introduced by Ishai, Pandey and Sahai (TCC 2015) relaxes the original definition of diO by requiring that only the actual random coins that were used to sample programs \(C_0\) and \(C_1\) can be used as the auxiliary input. Public-coin diO is indeed of great interest, since it not only allows to evade the implausible results of diO, but also yields several useful applications. However, as far as we know, there was no approach known to build a public-coin differing-input obfuscator neither for general-purpose programs/circuits such as NC\(^1\) circuits nor for special-purpose function such as some variant of point function. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|