109 search results - page 6 / 22 » Analysis of All-or-Nothing Hash Functions |
84
Voted
ICAPR
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. The possibility that a database with biometric data is compromised is one of the main concerns in implementing biometric identification systems. In this paper we present...
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
We prove that Tandem-DM, one of the two “classical” schemes for turning a blockcipher of 2n-bit key into a double block length hash function, has birthday-type collision resist...
IEEEIAS
2009
IEEE
15 years 4 months ago
2009
IEEE
: An algorithm for one-way hash function construction based on conservative chaotic system is proposed. The plaintext is divided into a group of message blocks by a fixed length an...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
ECCC
2011
14 years 4 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...