122 search results - page 4 / 25 » Reducing the Storage Requirements of a Perfect Hash Function |
GLOBECOM
2008
IEEE
14 years 1 months 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...
ANCS
2005
ACM
14 years 29 days ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
IPTPS
2004
Springer
14 years 22 days ago
2004
Springer
UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distr...
ACISP
2010
Springer
13 years 5 months ago
2010
Springer
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-...
IACR
2011
12 years 7 months ago
2011
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a ...