Defending the sybil attack in P2P networks: Taxonomy, challenges, and a proposal for self-registration

Proceedings - First International Conference on Availability, Reliability and Security, ARES 2006

Volumn 2006, Issue , 2006, Pages 756-763

  Dinger, Jochen ^a   Hartenstein, Hannes ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS);

NETWORK NODES; OVERLAY NETWORKS; SELF REGISTRATION; SYBIL ATTACK;

NETWORK PROTOCOLS;

EID: 33750953996     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2006.45     Document Type: Conference Paper

References (16)

1. K. Aberer, A. Datta, and M. Hauswirth. Efficient, self-contained handling of identity in Peer-to-Peer systems. IEEE Trans. on Knowledge and Data Engineering, 16(7), 2004.
2. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proc. of the 5th USENIX Symposium on Operating Systems Design and Impl., Boston, MA, USA, 2002.
3. A. Cheng and E. Friedman. Sybilproof reputation mechanisms. In Proc. of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 128-132, 2005.
4. G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-Resistant DHT Routing. In Proc. of Computer Security (ESORICS '05): 10th European Symp. on Research in Computer Sec. Springer, 2005.
5. J. Douceur. The Sybil Attack. In 1st International Workshop on Peer-to-Peer Systems (IPTPS '02). Springer, 2002.
6. M. Feldman, C. Papadimitriou, J. Chuang, and I. Stoica. Free-riding and whitewashing in peer-to-peer systems. In PINS '04: Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems, pages 228-236, New York, NY, USA, 2004. ACM Press.
7. A. Fiat, J. Saia, and M. Young. Making Chord Robust to Byzantine Attacks. In Proceedings of Algorithms - ESA 2005: 13th Annual European Symposium (LNCS 3669), pages 803-814. Springer, 2005.
8. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
9. R. C. Merkle. Secure communications over insecure channels. Commun. ACM, 21(4):294-299, 1978.
10. T. Narten and R. Draves. Privacy Extensions for Stateless Address Autoconfiguration in IPv6. RFC 3041, Jan. 2001.
11. J. Newsome, E. Shi, D. Song, and A. Perrig. The sybil attack in sensor networks: analysis & defenses. In Proc. of the third int. symposium on Information processing in sensor networks, pages 259-268, New York, NY, USA, 2004.
12. A. Rowstron and P. Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In Proc. of Int. Conf. on Distributed Systems Platforms (Middleware), pages 329-350, Heidelberg, Germany, 2001.
13. E. Sit and R. Morris. Security Considerations for Peer-to-Peer Distributed Hash Tables. In Peer-to-Peer Systems: 1st Int. Workshop (IPTPS '02), pages 261-269, 2002.
14. M. Srivatsa and L. Liu. Vulnerabilities and security threats in structured overlay networks: a quantitative analysis. In Proceedings of Computer Security Applications Conference, 2004. 20th Annual, pages 252-261. Springer, 2004.
15. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160. ACM Press, 2001.
16. H. Tyan. J-Sim. http://www.j-sim.org/, DRCL, The Ohio State University, 2005.