Name
Title | ||
|---|---|---|
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation. |
Abstract | ||
|---|---|---|
It is well known that the random-oracle RO model is not sound in the sense that there are schemes that are secure in the RO model but are insecure when instantiated by any family of hash functions. However, existing separation results do not hold for all cryptographic schemes in the RO model e.g., bit encryption, leaving open the possibility that such schemes can be soundly instantiated. In this work we refute this possibility, assuming the existence of indistinguishability obfuscation. First, we present a separation for bit encryption; namely, we show that there exists a bit-encryption protocol secure in the RO model but is 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 unified approach to showing separations for many protocols of interest in various idealized models. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-44618-9_31 | SCN |
DocType | Volume | ISSN |
Conference | 9841 | 0302-9743 |
Citations | PageRank | References |
1 | 0.35 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthew Green | 1 | 2007 | 114.98 |
| Jonathan Katz | 2 | 7579 | 347.97 |
| Alex J. Malozemoff | 3 | 158 | 8.98 |
| Hong-Sheng Zhou | 4 | 353 | 24.31 |