Limiting Sybil Attacks in Structured Peer-to-Peer Networks
暂无分享,去创建一个
[1] Ralph C. Merkle,et al. Secure communications over insecure channels , 1978, CACM.
[2] Ronald L. Rivest,et al. The MD5 Message-Digest Algorithm , 1992, RFC.
[3] Judith Donath,et al. Identity and deception in the virtual community , 1998 .
[4] Ari Juels,et al. Client puzzles: A cryptographic defense against connection depletion , 1999 .
[5] Pekka Nikander,et al. DOS-Resistant Authentication with Client Puzzles , 2000, Security Protocols Workshop.
[6] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[7] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .
[8] Adam Stubblefield,et al. Using Client Puzzles to Protect TLS , 2001, USENIX Security Symposium.
[9] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[10] Dan S. Wallach,et al. A Survey of Peer-to-Peer Security Issues , 2002, ISSS.
[11] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[12] Robert Tappan Morris,et al. Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.
[13] Miguel Castro,et al. Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.
[14] Jeong Hyun Yi,et al. Admission control in Peer-to-Peer: design and performance evaluation , 2003, SASN '03.
[15] Mudhakar Srivatsa,et al. Vulnerabilities and security threats in structured overlay networks: a quantitative analysis , 2004, 20th Annual Computer Security Applications Conference.
[16] Elaine Shi,et al. The Sybil attack in sensor networks: analysis & defenses , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[17] Miguel Castro,et al. Defending against eclipse attacks on overlay networks , 2004, EW 11.