Annual International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2010: Advances in Cryptology – EUROCRYPT 2010 pp 616-637

Universal One-Way Hash Functions via Inaccessible Entropy

  • Iftach Haitner
  • Thomas Holenstein
  • Omer Reingold
  • Salil Vadhan
  • Hoeteck Wee
Conference paper

DOI: 10.1007/978-3-642-13190-5_31

Volume 6110 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Haitner I., Holenstein T., Reingold O., Vadhan S., Wee H. (2010) Universal One-Way Hash Functions via Inaccessible Entropy. In: Gilbert H. (eds) Advances in Cryptology – EUROCRYPT 2010. EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, Heidelberg

Abstract

This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, which also obtains better efficiency and security. The construction exploits a strong connection to the recently introduced notion of inaccessible entropy (Haitner et al. STOC 2009). With this perspective, we observe that a small tweak of any one-way function f is already a weak form of a UOWHF: Consider F(x,i) that outputs the i-bit long prefix of f(x). If F were a UOWHF then given a random x and i it would be hard to come up with x′ ≠ x such that F(x,i) = F(x′,i). While this may not be the case, we show (rather easily) that it is hard to sample x′ with almost full entropy among all the possible such values of x′. The rest of our construction simply amplifies and exploits this basic property.

With this and other recent works, we have that the constructions of three fundamental cryptographic primitives (Pseudorandom Generators, Statistically Hiding Commitments and UOWHFs) out of one-way functions are to a large extent unified. In particular, all three constructions rely on and manipulate computational notions of entropy in similar ways. Pseudorandom Generators rely on the well-established notion of pseudoentropy, whereas Statistically Hiding Commitments and UOWHFs rely on the newer notion of inaccessible entropy.

Keywords

computational complexitycryptographyhashingtarget collision-resistanceone-way functions
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Iftach Haitner
    • 1
  • Thomas Holenstein
    • 2
  • Omer Reingold
    • 3
  • Salil Vadhan
    • 4
  • Hoeteck Wee
    • 5
  1. 1.Microsoft ResearchNew England
  2. 2.Department of Computer ScienceETH Zurich 
  3. 3.Silicon Valley and Weizmann Institute of ScienceMicrosoft Research 
  4. 4.School of Engineering & Applied Sci. and Center for Research on Computation & SocietyHarvard University 
  5. 5.Queens College, CUNY