Indistinguishability obfuscation with non-trivial efficiency

Huijia Lin*, Rafael Pass, Karn Seth, Sidharth Telang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationPublic-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
EditorsChen-Mou Cheng, Kai-Min Chung, Bo-Yin Yang, Giuseppe Persiano
PublisherSpringer Verlag
Pages447-462
Number of pages16
ISBN (Print)9783662493861
DOIs
StatePublished - 2016
Externally publishedYes
Event19th IACR International Conference on Practice and Theory in Public-Key Cryptography, PKC 2016 - Taipei, Taiwan, Province of China
Duration: 6 Mar 20169 Mar 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9615
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th IACR International Conference on Practice and Theory in Public-Key Cryptography, PKC 2016
Country/TerritoryTaiwan, Province of China
CityTaipei
Period6/03/169/03/16

Funding

FundersFunder number
Microsoft Faculty Fellowship
National Science FoundationCCF-1214844, CNS-1514526, CNS-1217821, CNS-1528178
Air Force Office of Scientific ResearchFA9550-15-1-0262
Defense Advanced Research Projects Agency
Air Force Research LaboratoryFA8750-11-2-0211
Google

    Fingerprint

    Dive into the research topics of 'Indistinguishability obfuscation with non-trivial efficiency'. Together they form a unique fingerprint.

    Cite this