Paper 2015/114 Original: eprint.iacr.org/2015/114 ↗
Weak Ideal Functionalities for Designing Random Oracles with Applications to Fugue
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2015-02-24: last updated
- 2015-02-24: published
- Short URL
- https://ia.cr/2015/114
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/114,
author = {Shai Halevi and William E. Hall and Charanjit S. Jutla and Arnab Roy},
title = {Weak Ideal Functionalities for Designing Random Oracles with Applications to Fugue},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/114},
year = {2015},
url = {https://eprint.iacr.org/2015/114}
}