On extractability obfuscation

Elette Boyle, Kai Min Chung, Rafael Pass

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


We initiate the study of extractability obfuscation, a notion first suggested by Barak et al. (JACM 2012): An extractability obfuscator for a class of algorithms guarantees that if an efficient attacker can distinguish between obfuscations of two algorithms, then can efficiently recover (given M 1 and M 2) an input on which M 1 and M 2 provide different outputs. We rely on the recent candidate virtual black-box obfuscation constructions to provide candidate constructions of extractability obfuscators for NC 1; next, following the blueprint of Garg et al. (FOCS 2013), we show how to bootstrap the obfuscator for NC 1 to an obfuscator for all non-uniform polynomial-time Turing machines. In contrast to the construction of Garg et al., which relies on indistinguishability obfuscation for NC 1, our construction enables succinctly obfuscating non-uniform Turing machines (as opposed to circuits), without turning running-time into description size. We introduce a new notion of functional witness encryption, which enables encrypting a message m with respect to an instance x, language L, and function f, such that anyone (and only those) who holds a witness w for x â̂̂ L can compute f(m,w) on the message and particular known witness. We show that functional witness encryption is, in fact, equivalent to extractability obfuscation. We demonstrate other applications of extractability extraction, including the first construction of fully (adaptive-message) indistinguishability-secure functional encryption for an unbounded number of key queries and unbounded message spaces. We finally relate indistinguishability obfuscation and extractability obfuscation and show special cases when indistinguishability obfuscation can be turned into extractability obfuscation.

Original languageEnglish
Title of host publicationTheory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, Proceedings
PublisherSpringer Verlag
Number of pages22
ISBN (Print)9783642542411
StatePublished - 2014
Externally publishedYes
Event11th Theory of Cryptography Conference on Theory of Cryptography, TCC 2014 - San Diego, CA, United States
Duration: 24 Feb 201426 Feb 2014

Publication series

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


Conference11th Theory of Cryptography Conference on Theory of Cryptography, TCC 2014
Country/TerritoryUnited States
CitySan Diego, CA


Dive into the research topics of 'On extractability obfuscation'. Together they form a unique fingerprint.

Cite this