4438 search results - page 38 / 888 » On the Distribution of Keys by Hashing |
ISCC
2006
IEEE
15 years 5 months ago
2006
IEEE
Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
SAINT
2006
IEEE
15 years 5 months ago
2006
IEEE
Despite the scalability, availability and resiliency potential suggested by Distributed Hash Tables, their lack of support for replication of mutable data and for strong consisten...
116
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
112
click to vote
IPTPS
2003
Springer
15 years 5 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
106
click to vote
EUROCRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial “key leakage” attacks. In th...