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...
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 ...
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...
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 ...
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...