Paper 2014/518
Cryptography from Compression Functions: The UCE Bridge to the ROM
Mihir Bellare, Viet Tung Hoang, and Sriram Keelveedhi
Abstract
This paper suggests and explores the use of UCE security for the task of turning VIL-ROM schemes into FIL-ROM ones. The benefits we offer over indifferentiability, the current leading method for this task, are the ability to handle multi-stage games and greater efficiency. The paradigm consists of (1) Showing that a VIL UCE function can instantiate the VIL RO in the scheme, and (2) Constructing the VIL UCE function given a FIL random oracle. The main technical contributions of the paper are domain extension transforms that implement the second step. Leveraging known results for the first step we automatically obtain FIL-ROM constructions for several primitives whose security notions are underlain by multi-stage games. Our first domain extender exploits indifferentiability, showing that although the latter does not work directly for multi-stage games it can be used indirectly, through UCE, as a tool for this end. Our second domain extender targets performance. It is parallelizable and shown through implementation to provide significant performance gains over indifferentiable domain extenders.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Major revision. CRYPTO 2014
- Keywords
- random-oracle modelindifferentiabilitymulti-stage gamesUCEparallelizable hash
- Contact author(s)
- vth005 @ eng ucsd edu
- History
- 2014-07-03: received
- Short URL
- https://ia.cr/2014/518
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/518,
author = {Mihir Bellare and Viet Tung Hoang and Sriram Keelveedhi},
title = {Cryptography from Compression Functions: The {UCE} Bridge to the {ROM}},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/518},
year = {2014},
url = {https://eprint.iacr.org/2014/518}
}