Paper 2015/581
Universal Computational Extractors and the Superfluous Padding Assumption for Indistinguishability Obfuscation
Chris Brzuska and Arno Mittelbach
Abstract
Universal Computational Extractors (UCEs), introduced by Bellare, Hoang and Keelveedhi (CRYPTO 2013), are a framework of assumptions on hash functions that allow to instantiate random oracles in a large variety of settings. Brzuska, Farshim and Mittelbach (CRYPTO 2014) showed that a large class of UCE assumptions with \emph{computationally} unpredictable sources cannot be achieved, if indistinguishability obfuscation exists. In the process of circumventing obfuscation-based attacks, new UCE notions emerged, most notably UCEs with respect to \emph{statistically} unpredictable sources that suffice for a large class of applications. However, the only standard model constructions of UCEs are for a small subclass considering only
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Universal computational extractorsstandard modelsuperfluous padding assumptionindistinguishability obfuscationpoint obfuscation
- Contact author(s)
- mail @ arno-mittelbach de
- History
- 2015-06-21: received
- Short URL
- https://ia.cr/2015/581
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/581, author = {Chris Brzuska and Arno Mittelbach}, title = {Universal Computational Extractors and the Superfluous Padding Assumption for Indistinguishability Obfuscation}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/581}, year = {2015}, url = {https://eprint.iacr.org/2015/581} }