The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
Name
1401.0348.pdf
Description
Accepted version
Size
317.84 KB
Format
Adobe PDF
Checksum (MD5)
3c07160494d10f9328996663cec9db7c
Author(s)
Bitansky, Nir
Canetti, Ran
Cohn, Henry
Goldwasser, Shafi
Kalai, Yael Tauman
Paneth, Omer
Rosen, Alon
Date Issued
2014
Publisher
Springer Nature
Citation
Bitansky, Nir, Canetti, Ran, Cohn, Henry, Goldwasser, Shafi, Kalai, Yael Tauman et al. 2014. "The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator."
Version
Author's final manuscript
Abstract
In this paper we show that indistinguishability obfuscation for general circuits implies, somewhat counterintuitively, strong impossibility results for virtual black box obfuscation. In particular, it implies: - The impossibility of average-case virtual black box obfuscation with auxiliary input for any circuit family with super-polynomial pseudo-entropy (for example, many cryptographic primitives). Impossibility holds even when the auxiliary input depends only on the public circuit family, and not which circuit in the family is being obfuscated. - The impossibility of average-case virtual black box obfuscation with a universal simulator (with or without any auxiliary input) for any circuit family with super-polynomial pseudo-entropy. These bounds significantly strengthen the impossibility results of Goldwasser and Kalai (FOCS 2005). © 2014 International Association for Cryptologic Research.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-662-44381-1_5
