648 search results - page 4 / 130 » Authenticated hash tables |
CRYPTO
1991
Springer
13 years 9 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
GLOBECOM
2008
IEEE
14 years 7 days ago
2008
IEEE
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
LCN
2008
IEEE
14 years 5 days ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
LCN
2006
IEEE
13 years 11 months ago
2006
IEEE
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...