Sciweavers

1080 search results - page 14 / 216
» Distributed Hash Tables
Sort
View
CCS
2008
ACM
15 years 4 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
IPTPS
2005
Springer
15 years 8 months ago
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state ...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
IPTPS
2004
Springer
15 years 7 months ago
When Multi-hop Peer-to-Peer Lookup Matters
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these syste...
Rodrigo Rodrigues, Charles Blake
ICMCS
2010
IEEE
178views Multimedia» more  ICMCS 2010»
15 years 3 months ago
Optimal configuration of hash table based multimedia fingerprint databases using weak bits
The increasingly large amount of digital multimedia content has created a need for technologies to search and identify multimedia files. Multimedia fingerprinting has been widely ...
Claus Bauer, Regunathan Radhakrishnan, Wenyu Jiang
JNW
2006
145views more  JNW 2006»
15 years 2 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman