Sciweavers

4438 search results - page 12 / 888
» On the Distribution of Keys by Hashing
Sort
View
ASIACRYPT
2003
Springer
15 years 5 months ago
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
Dwaine E. Clarke, Srinivas Devadas, Marten van Dij...
AINA
2007
IEEE
15 years 6 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
ISW
2004
Springer
15 years 5 months ago
Chameleon Hashing Without Key Exposure
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
ASIACRYPT
2007
Springer
15 years 5 months ago
Cryptanalysis of Grindahl
Due to recent breakthroughs in hash functions cryptanalysis, some new hash schemes have been proposed. GRINDAHL is a novel hash function, designed by Knudsen, Rechberger and Thomse...
Thomas Peyrin
CCS
2008
ACM
15 years 1 months ago
HMAC is a randomness extractor and applications to TLS
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
Pierre-Alain Fouque, David Pointcheval, Séb...