46 search results - page 3 / 10 » More Practical and Secure History-Independent Hash Tables |
CRYPTO
1997
Springer
15 years 1 months ago
1997
Springer
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
ACSAC
2003
IEEE
15 years 2 months ago
2003
IEEE
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...