TY - GEN

T1 - Indistinguishability obfuscation with non-trivial efficiency

AU - Lin, Huijia

AU - Pass, Rafael

AU - Seth, Karn

AU - Telang, Sidharth

N1 - Publisher Copyright:
© International Association for Cryptologic Research 2016.

PY - 2016

Y1 - 2016

N2 - It is well known that inefficient indistinguishability obfuscators (iO) with running time poly(|C|, λ) · 2n, where C is the circuit to be obfuscated, λ is the security parameter, and n is the input length of C, exists unconditionally: simply output the function table of C (i. e., the output of C on all possible inputs). Such inefficient obfuscators, however, are not useful for applications. We here consider iO with a slightly “non-trivial” notion of efficiency: the running-time of the obfuscator may still be “trivial” (namely, poly(|C|, λ) · 2n), but we now require that the obfuscated code is just slightly smaller than the truth table of C (namely poly(|C|, λ) · 2n(1−ɛ), where ɛ > 0); we refer to this notion as iO with exponential efficiency, or simply exponentially-efficient iO (Xio). We show that, perhaps surprisingly, under the subexponential LWE assumption, subexponentiallysecure XiO for polynomial-size circuits implies (polynomial-time computable) iO for all polynomial-size circuits.

AB - It is well known that inefficient indistinguishability obfuscators (iO) with running time poly(|C|, λ) · 2n, where C is the circuit to be obfuscated, λ is the security parameter, and n is the input length of C, exists unconditionally: simply output the function table of C (i. e., the output of C on all possible inputs). Such inefficient obfuscators, however, are not useful for applications. We here consider iO with a slightly “non-trivial” notion of efficiency: the running-time of the obfuscator may still be “trivial” (namely, poly(|C|, λ) · 2n), but we now require that the obfuscated code is just slightly smaller than the truth table of C (namely poly(|C|, λ) · 2n(1−ɛ), where ɛ > 0); we refer to this notion as iO with exponential efficiency, or simply exponentially-efficient iO (Xio). We show that, perhaps surprisingly, under the subexponential LWE assumption, subexponentiallysecure XiO for polynomial-size circuits implies (polynomial-time computable) iO for all polynomial-size circuits.

UR - http://www.scopus.com/inward/record.url?scp=84959252920&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-49387-8_17

DO - 10.1007/978-3-662-49387-8_17

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84959252920

SN - 9783662493861

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 447

EP - 462

BT - Public-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings

A2 - Cheng, Chen-Mou

A2 - Chung, Kai-Min

A2 - Yang, Bo-Yin

A2 - Persiano, Giuseppe

PB - Springer Verlag

T2 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, PKC 2016

Y2 - 6 March 2016 through 9 March 2016

ER -