Bypass: Providing secure DHT routing through bypassing malicious peers

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2008, Pages 934-941

  Sánchez Artigas, Marc ^a   López, Pedro García ^a   Skarmeta, Antonio F Gómez ^b  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b UNIVERSITY OF MURCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ROUTING PROTOCOLS;

DHT ROUTING; DHT ROUTING PROTOCOLS; DISTRIBUTED HASH TABLES; FILTERING PROTOCOLS; MALICIOUS NODES; MALICIOUS PEERS; ROUTE REQUESTS; ROUTING ATTACKS; SECURITY ISSUES;

COMPUTER NETWORKS;

EID: 55849135611     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2008.4625618     Document Type: Conference Paper

References (7)

1. M. Artigas et. al. A novel methodology for constructing secure multipath overlays. IEEE Internet Computing, 9(6):50-57, 2005.
2. M. Castro et. al. Secure routing for structured peer-to-peer overlay networks. SIGOPS Oper. Syst. Rev., 36(SI):299-314, 2002.
3. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware'01, pages 329-350, 2001.
4. A. Singh et. al. Defending against eclipse attacks on overlay networks. In ACM EW11, page 21, 2004.
5. M. Srivatsa and L. Liu. Vulnerabilities and security threats in structured overlay networks: A quantitative analysis. In ACSAC'04, pages 252-261, 2004.
6. M. Srivatsa et. al. Trustguard: countering vulnerabilities in reputation management for decentralized overlay networks. In WWW'05, pages 422-431, 2005.
7. I. Stoica et. al. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw., 11(1):17-32, 2003.