Distributed Computing

, Volume 19, Issue 4, pp 267–287

On the establishment of distinct identities in overlay networks

Original article

DOI: 10.1007/s00446-006-0012-y

Cite this article as:
Bazzi, R.A. & Konjevod, G. Distrib. Comput. (2007) 19: 267. doi:10.1007/s00446-006-0012-y


We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it is possible to remotely issue certificates that can be used to test the distinctness of identities. Our certification protocols are based on geometric techniques that establish location information in a fault-tolerant and distributed fashion. They do not rely on a centralized certifying authority or infrastructure that has direct knowledge of entities in the system, and work in Euclidean or spherical geometry of arbitrary dimension. They tolerate corrupt entities, including corrupt certifiers, collusion by either certification applicants or certifiers, and either a broadcast or point-to-point message model.


Sybil attack Identity verification Overlay networks Peer-to-peer systems Distance geometry 

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.Computer Science and Engineering DepartmentArizona State UniversityTempeUSA

Personalised recommendations