Universal One-Way Hash Functions via Inaccessible Entropy

DSpace/Manakin Repository

Universal One-Way Hash Functions via Inaccessible Entropy

Citable link to this page


Title: Universal One-Way Hash Functions via Inaccessible Entropy
Author: Vadhan, Salil P.; Haitner, Iftach; Holenstein, Thomas; Reingold, Omer; Wee, Hoeteck

Note: Order does not necessarily reflect citation order of authors.

Citation: Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. Forthcoming. Universal one-way hash functions via inaccessible entropy. Advances in Cryptology - EUROCRYPT 2010 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Nice, France, May 30-June 3, 2010; Proceedings. Lecture Notes in Computer Science.
Full Text & Related Files:
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.
Published Version: http://www.springer.com/computer/lncs?SGWID=0-164-0-0-0
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#OAP
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:3742987
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search