On the establishment of distinct identities in overlay networks

Rida Bazzi, Goran Konjevod

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)267-287
Number of pages21
JournalDistributed Computing
Volume19
Issue number4
DOIs
StatePublished - Mar 2007

Fingerprint

Overlay networks
Peer to peer networks
Overlay Networks
Certification
Distinct
Spherical geometry
Network protocols
Euclidean geometry
Collusion
Geometry
Peer-to-peer Networks
Certificate
Fault-tolerant
Broadcast
Damage
Infrastructure
Arbitrary
Model
Knowledge

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

On the establishment of distinct identities in overlay networks. / Bazzi, Rida; Konjevod, Goran.

In: Distributed Computing, Vol. 19, No. 4, 03.2007, p. 267-287.

Research output: Contribution to journalArticle

Bazzi, Rida ; Konjevod, Goran. / On the establishment of distinct identities in overlay networks. In: Distributed Computing. 2007 ; Vol. 19, No. 4. pp. 267-287.
@article{08389faa4c524e879a66939122eddd36,
title = "On the establishment of distinct identities in overlay networks",
abstract = "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.",
keywords = "Distance geometry, Identity verification, Overlay networks, Peer-to-peer systems, Sybil attack",
author = "Rida Bazzi and Goran Konjevod",
year = "2007",
month = "3",
doi = "10.1007/s00446-006-0012-y",
language = "English (US)",
volume = "19",
pages = "267--287",
journal = "Distributed Computing",
issn = "0178-2770",
publisher = "Springer Verlag",
number = "4",

}

TY - JOUR

T1 - On the establishment of distinct identities in overlay networks

AU - Bazzi, Rida

AU - Konjevod, Goran

PY - 2007/3

Y1 - 2007/3

N2 - 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.

AB - 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.

KW - Distance geometry

KW - Identity verification

KW - Overlay networks

KW - Peer-to-peer systems

KW - Sybil attack

UR - http://www.scopus.com/inward/record.url?scp=33847246741&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847246741&partnerID=8YFLogxK

U2 - 10.1007/s00446-006-0012-y

DO - 10.1007/s00446-006-0012-y

M3 - Article

VL - 19

SP - 267

EP - 287

JO - Distributed Computing

JF - Distributed Computing

SN - 0178-2770

IS - 4

ER -