On the establishment of distinct identifies in overlay networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 312-320

  Bazzi, Rida A ^a   Konjevod, Goran ^a  

^a AZ 85281   (United States)

Author keywords

Distance geometry; Fault tolerance; Identity verification; Overlay networks; Peer to peer systems; Security; Sybil attack

Indexed keywords

DISTANCE GEOMETRY; IDENTITY VERIFICATION; OVERLAY NETWORKS; PEER-TO-PEER SYSTEMS; SYBIL ATTACK;

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; IDENTIFICATION (CONTROL SYSTEMS); INFORMATION ANALYSIS;

NETWORK PROTOCOLS;

EID: 32344438389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073873     Document Type: Conference Paper

References (8)

1. E. Amaldi and V. Kann. The complexity and approximability of finding maximum feasible subsets of linear relations. Theoretical Computer Science, 147:181-210, 1995.
2. L. Blumenthal. Theory and applications of distance geometry. Clarendon Press, 1953.
3. M. Deza and M. Laurent. Geometry of cuts and metrics. Springer, 1997.
4. J. Douceur. The Sybil attack. In Proc. of IPTPS, pages 251-260, 2002.
5. J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In Proc. of the IEEE FOCS, pages 444-453, 2004.
6. J. Newsome, E. Shi, D. Song, and A. Perrig. The Sybil attack in sensor networks: analysis and defenses. In Proc. of IPSN, 2004.
7. T. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proc. of INFOCOM, 2002.
8. N. Sastry, U. Shankar, and D. Wagner. Secure verification of location claims. In Proc. of ACM WiSe, 2003.