Sciweavers

208 search results - page 4 / 42
» Variationally universal hashing
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
14 years 9 days ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
CRYPTO
2008
Springer
100views Cryptology» more  CRYPTO 2008»
14 years 20 days ago
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Abstract. This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verif...
Helena Handschuh, Bart Preneel
ASIACRYPT
2004
Springer
14 years 4 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
CRYPTO
2007
Springer
88views Cryptology» more  CRYPTO 2007»
14 years 5 months ago
Invertible Universal Hashing and the TET Encryption Mode
This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using a...
Shai Halevi
EUROCRYPT
2010
Springer
14 years 3 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, ...