STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
Protecting Free Expression Online with Freenet
IEEE Internet Computing
IEEE Internet Computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Defending Anonymous Communications Against Passive Logging Attacks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
Multiagent and Grid Systems
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Improving sender anonymity in a structured overlay with imprecise routing
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
| Hi-index | 0.00 |
In Peer-to-peer (P2P) systems, it is often essential that connected systems (nodes) relay messages which did not originate locally, on to the greater network. As a result, an intermediate node might be able to determine a large amount of information about the system, such as the querying tendencies of other nodes. This represents an inherent security issue in P2P networks. Therefore, we ask the following question: Through the observation of the network traffic in a P2P network, what kind of information can an adversarial node learn about another node in the same network ? In this paper, we study this question in the case of a specific P2P system - Chord [10]. We also study the effects of the parameters of Chord (such as finger-table size) and the various enhancements to Chord (such as location caching and data caching) on the amount of information leaked.