17 search results - page 1 / 4 » A bound on the size of separating hash families |
JCT
2011
12 years 11 months ago
2011
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key...
JCT
2008
13 years 4 months ago
2008
TIT
2008
13 years 4 months ago
2008
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...
ECCC
2011
12 years 11 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
IACR
2011
12 years 4 months ago
2011
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...