268 search results - page 18 / 54 » An Analysis of Bitstate Hashing |
ISVLSI
2006
IEEE
14 years 3 months ago
2006
IEEE
Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail ...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in o...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
P2P
2007
IEEE
14 years 3 months ago
2007
IEEE
An important security issue in DHT-based structured overlay networks is to provide anonymity to the storage nodes. Compromised routing tables in those DHTs leak information about ...