Sciweavers

110 search results - page 14 / 22
» A Kademlia-Based Node Lookup System for Anonymization Networ...
Sort
View
JNW
2006
145views more  JNW 2006»
13 years 7 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
P2P
2007
IEEE
165views Communications» more  P2P 2007»
14 years 1 months ago
An Information-Theoretic Framework for Analyzing Leak of Privacy in Distributed Hash Tables
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 ...
Souvik Ray, Zhao Zhang
EUROPAR
2004
Springer
14 years 23 days ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
TKDE
2008
137views more  TKDE 2008»
13 years 7 months ago
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
Runfang Zhou, Kai Hwang, Min Cai
SPAA
2009
ACM
14 years 8 months ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...