Sciweavers

30 search results - page 1 / 6
» Higher Order Universal One-Way Hash Functions
Sort
View
ASIACRYPT
2004
Springer
13 years 10 months ago
Higher Order Universal One-Way Hash Functions
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...
Deukjo Hong, Bart Preneel, Sangjin Lee
EUROCRYPT
2000
Springer
13 years 8 months ago
A Composition Theorem for Universal One-Way Hash Functions
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed...
Victor Shoup
EUROCRYPT
2010
Springer
13 years 9 months ago
Universal One-Way Hash Functions via Inaccessible Entropy
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, whi...
Iftach Haitner, Thomas Holenstein, Omer Reingold, ...
FOCS
1999
IEEE
13 years 9 months ago
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
Jeong Han Kim, Daniel R. Simon, Prasad Tetali
ACNS
2005
Springer
111views Cryptology» more  ACNS 2005»
13 years 10 months ago
Badger - A Fast and Provably Secure MAC
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is us...
Martin Boesgaard, Thomas Christensen, Erik Zenner