Name
Abstract | ||
|---|---|---|
We define ideal functionalities that are weaker than ideal functionalities traditionally used in realizing variable input length (VIL) random oracles (RO) in the indifferentiability or universal-Composability (UC) model. We also show realization of VIL-RO using these weaker ideal functionalities, with applications to proving Fugue and CubeHash hash functions to be VIL-RO. We argue that components of Fugue realize this weaker ideal functionality using techniques employed in proving resistance of Fugue to differential collision-attacks. This should be contrasted with other hash functions that are proven VIL-RO assuming the components are extremely ideal, e.g. random permutations. |
Year | Venue | Field |
|---|---|---|
2015 | IACR Cryptology ePrint Archive | Discrete mathematics,CubeHash,Permutation,Hash function,Fugue,Mathematics |
DocType | Volume | Citations |
Journal | 2015 | 0 |
PageRank | References | Authors |
0.34 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shai Halevi | 1 | 7203 | 442.70 |
| William Eric Hall | 2 | 0 | 0.68 |
| Charanjit S. Jutla | 3 | 1797 | 187.06 |
| Arnab Roy | 4 | 365 | 28.23 |