4438 search results - page 25 / 888 » On the Distribution of Keys by Hashing |
134
click to vote
FSE
2010
Springer
15 years 10 months ago
2010
Springer
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...
191
click to vote
ICALP
1994
Springer
15 years 10 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
176
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...
157
click to vote
TCC
2005
Springer
15 years 11 months ago
2005
Springer
Russell and Wang [22] recently introduced an elegant, information-theoretic notion called entropic security of encryption: they required that the cipher text leak no predicate of ...
138
click to vote
P2P
2009
IEEE
16 years 23 days ago
2009
IEEE
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...