IACR News item: 22 October 2014
Matthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou
ePrint ReportIn this work we refute this possibility, assuming the existence of indistinguishability obfuscation. We do so in the following way. First, we present a random oracle separation for bit-encryption; namely, we show that there exists a bit-encryption protocol secure in the random oracle model but \\emph{completely insecure} when the random oracle is instantiated by any concrete function. Second, we show how to adapt this separation to work for most natural simulation-based and game-based definitions. Our techniques can easily be adapted to other idealized models, and thus we present a \\emph{unified approach} to showing separations for most protocols of interest in most idealized models.
Additional news items may be found on the IACR news page.