Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Anonymity in Structured Peer-to-Peer Networks

Nikita Borisov and Jason Waddle

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-05-1390
May 2005

http://www.eecs.berkeley.edu/Pubs/TechRpts/2005/CSD-05-1390.pdf

Existing peer-to-peer systems that aim to provide anonymity to its users are based on networks with unstructured or loosely-structured routing algorithms. Structured routing offers performance and robustness guarantees that these systems are unable to achieve. We therefore investigate adding anonymity support to structured peer-to-peer networks. We apply an entropy-based anonymity metric to Chord and use this metric to quantify the improvements in anonymity afforded by several possible extensions. We identify particular properties of Chord that have the strongest effect on anonymity and propose a routing extension that allows a general trade-off between anonymity and performance. Our results should be applicable to other structured peer-to-peer systems.


BibTeX citation:

@techreport{Borisov:CSD-05-1390,
    Author = {Borisov, Nikita and Waddle, Jason},
    Title = {Anonymity in Structured Peer-to-Peer Networks},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2005},
    Month = {May},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2005/6509.html},
    Number = {UCB/CSD-05-1390},
    Abstract = {Existing peer-to-peer systems that aim to provide anonymity to its users are based on networks with unstructured or loosely-structured routing algorithms. Structured routing offers performance and robustness guarantees that these systems are unable to achieve. We therefore investigate adding anonymity support to structured peer-to-peer networks. We apply an entropy-based anonymity metric to Chord and use this metric to quantify the improvements in anonymity afforded by several possible extensions. We identify particular properties of Chord that have the strongest effect on anonymity and propose a routing extension that allows a general trade-off between anonymity and performance. Our results should be applicable to other structured peer-to-peer systems.}
}

EndNote citation:

%0 Report
%A Borisov, Nikita
%A Waddle, Jason
%T Anonymity in Structured Peer-to-Peer Networks
%I EECS Department, University of California, Berkeley
%D 2005
%@ UCB/CSD-05-1390
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2005/6509.html
%F Borisov:CSD-05-1390