Measurements and Mitigation of Peer-to-Peer-based Botnets: A Case Study on Storm Worm.

T Holz, M Steiner, F Dahl, EW Biersack, FC Freiling - Leet, 2008 - usenix.org
Measurements and Mitigation of Peer-to-Peer-based Botnets: A Case Study on Storm Worm
Check out the new USENIX Web site. Measurements and Mitigation of Peer-to-Peer-based …

Survey on load balancing in peer-to-peer distributed hash tables

P Felber, P Kropf, E Schiller… - … Surveys & Tutorials, 2013 - ieeexplore.ieee.org
Peer-to-peer systems represent a radical shift from the classical client-server paradigm in
which a centralized server processes requests from all clients. In a peer-to-peer (P2P) …

Long Term Study of Peer Behavior in the kad DHT

M Steiner, T En-Najjary… - IEEE/ACM Transactions …, 2009 - ieeexplore.ieee.org
Distributed hash tables (DHTs) have been actively studied in literature and many different
proposals have been made on how to organize peers in a DHT. However, very few DHTs …

[PDF][PDF] Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs.

S Wolchok, OS Hofmann, N Heninger, EW Felten… - NDSS, 2010 - jhalderm.com
Researchers at the University of Washington recently proposed Vanish [20], a system for
creating messages that automatically “self-destruct” after a period of time. Vanish works by …

Exploiting KAD: possible uses and misuses

M Steiner, T En-Najjary, EW Biersack - ACM SIGCOMM Computer …, 2007 - dl.acm.org
Peer-to-peer systems have seen a tremendous growth in the last few years and peer-to-peer
traffic makes a major fraction of the total traffic seen in the Internet. The dominating …

Scalable onion routing with torsk

J McLachlan, A Tran, N Hopper, Y Kim - … of the 16th ACM conference on …, 2009 - dl.acm.org
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is
designed as an interoperable replacement for the relay selection and directory service of the …

Attacking the kad network

P Wang, J Tyra, E Chan-Tin, T Malchow… - Proceedings of the 4th …, 2008 - dl.acm.org
The Kad network, an implementation of the Kademlia DHT protocol, supports the popular
eDonkey peer-to-peer file sharing network and has over 1 million concurrent nodes. We …

[PDF][PDF] Large-scale monitoring of DHT traffic.

G Memon, R Rejaie, Y Guo, D Stutzbach - IPTPS, 2009 - usenix.org
Studying deployed Distributed Hash Tables (DHTs) entails monitoring DHT traffic.
Commonly, DHT traffic is measured by instrumenting ordinary peers to passively record …

ID repetition in Kad

J Yu, C Fang, J Xu, EC Chang… - 2009 IEEE Ninth …, 2009 - ieeexplore.ieee.org
ID uniqueness is essential in DHT-based systems as peer lookup and resource searching
rely on ID-matching. Many previous works and measurements on Kad do not take into …

Evaluating and improving the content access in KAD

M Steiner, D Carra, EW Biersack - Peer-to-peer networking and …, 2010 - Springer
We analyze in detail the content retrieval process in kad. kad implements content search
(publish and retrieval) functions that use the Kademlia Distributed Hash Table for content …