## Domain extension of public random functions: Beyond the birthday barrier (2007)

Venue: | In Advances in Cryptology – CRYPTO ’07 (2007), Lecture Notes in Computer Science |

Citations: | 7 - 1 self |

### BibTeX

@INPROCEEDINGS{Maurer07domainextension,

author = {Ueli Maurer and Stefano Tessaro},

title = {Domain extension of public random functions: Beyond the birthday barrier},

booktitle = {In Advances in Cryptology – CRYPTO ’07 (2007), Lecture Notes in Computer Science},

year = {2007},

pages = {187--204},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

Combined with the iterated constructions of Coron et al., our result leads to the first iterated construction of a hash function f0; 1g\Lambda ! f0; 1gn from a component function f0; 1gn! f0; 1gn that withstands all recently proposed generic attacks against iterated hash functions, like Joux's multi-collision attack, Kelsey and Schneier's second-preimage attack, and Kelsey and Kohno's herding attacks. 1 Introduction 1.1 Secret vs. Public Random Functions Primitives that provide some form of randomness are of central importance in cryptography, both as a primitive assumed to be given (e.g. a secret key), and as a primitive constructed from a weaker one to "behave like " a certain ideal random primitive (e.g. a random function), according to some security notion.