Sciweavers

713 search results - page 111 / 143
» Dispersing Hash Functions
Sort
View
CTRSA
2006
Springer
118views Cryptology» more  CTRSA 2006»
15 years 1 months ago
Stand-Alone and Setup-Free Verifiably Committed Signatures
Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signat...
Huafei Zhu, Feng Bao
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 1 months ago
An Improved Construction for Counting Bloom Filters
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
FSE
2006
Springer
114views Cryptology» more  FSE 2006»
15 years 1 months ago
Cryptanalysis of the Full HAVAL with 4 and 5 Passes
Abstract. HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992. It has three variants, 3-, 4-, and 5-pass HAVAL. Previou...
Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park
EUROCRYPT
2000
Springer
15 years 1 months ago
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
We exhibit an attack against a signature scheme recently proposed by Gennaro, Halevi and Rabin [9]. The scheme's security is based on two assumptions namely the strong RSA ass...
Jean-Sébastien Coron, David Naccache
ICPP
1995
IEEE
15 years 1 months ago
The Application of Skewed-Associative Memories to Cache Only Memory Architectures
— Skewed-associative caches use several hash functions to reduce collisions in caches without increasing the associativity. This technique can increase the hit ratio of a cache w...
Henk L. Muller, Paul W. A. Stallard, David H. D. W...