Skip to main content
SpringerLink
Log in

On the establishment of distinct identities in overlay networks

  • Original article
  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agarwal N., Basch J., Beckmann P., Bharti P., Bloebaum S., Casadei S., Chou A., Enge P., Fong W., Hathi N., Mann W., Sahai A., Stone J., Tsitsiklis J., Roy B.V. (2002) Algorithms for GPS operation indoors and downtown. GPS Solut. 6, 149–160

    Article  Google Scholar 

  2. Amaldi E., Kann V. (1995) The complexity and approximability of finding maximum feasible subsets of linear relations. Theoret. Comput. Sci. 147, 181–210

    Article  MATH  MathSciNet  Google Scholar 

  3. Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximation Algorithms for NP-hard Problems, pp. 396–345. PWS (1997)

  4. Blumenthal L. (1953) Theory and Applications of Distance Geometry. Clarendon Press, Oxford

    MATH  Google Scholar 

  5. Brönnimann, H.: Derandomization of geometric algorithms. Ph.D. thesis, Princeton University (1995)

  6. Brönnimann, H., Goodrich, M.: Almost optimal set covers in finite VC dimension. In: Proceedings of the 10th Annual ACM Symposium on Computational Geometry, pp. 292–302 (1994)

  7. Čapkun, S., Hubaux, J.P.: Secure positioning of wireless devices with applications to sensor networks. In: Proceedings of INFOCOM (2005)

  8. Čapkun S., Hubaux J.P. (2006) Secure positioning in wireless networks. IEEE J. Sel. Areas Commun. 24(2): 221–232

    Article  Google Scholar 

  9. Deza M., Laurent M. (1997) Geometry of Cuts and Metrics. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  10. Douceur, J.: The Sybil attack. In: Proceedings of IPTPS, pp. 251–260 (2002)

  11. Feige U. (1998) A threshold of ln n for approximating set cover. J. ACM 45, 634–652

    Article  MATH  MathSciNet  Google Scholar 

  12. Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Approximation Algorithms for NP-hard Problems, pp. 94–143. PWS (1997)

  13. Hu, Y.C., Perrig, A., Johnson, D.B.: Packet leashes: a defense against wormhole attacks in wireless networks. In: Proceedings of INFOCOM (2003)

  14. Kleinberg, J., Slivkins, A., Wexler, T.: Triangulation and embedding using small sets of beacons. In: Proceedings of the IEEE FOCS, pp. 444–453 (2004)

  15. Lazos, L., Poovendran, R.: SeRLoc: secure range-independent localization for wireless networks. In: Proceedings of WISE 2004 (2004)

  16. Luo, J., Shukla, H.V., Hubaux, J.P.: Non-interactive location surveying for sensor networks with mobility-differentiated ToA. In: Proceedings of INFOCOM (2006)

  17. Matoušek, J., Seidel, R., Welzl, E.: How to net a lot with little: small ε-nets for disks and halfspaces. In: Proceedings of the 6th Annual ACM Symposium on Computational Geometry, pp. 16–22 (1990)

  18. Newsome, J., Shi, E., Song, D., Perrig, A.: The Sybil attack in sensor networks: analysis and defenses. In: Proceedings of IPSN (2004)

  19. Ng, T., Zhang, H.: Predicting Internet network distance with coordinates-based approaches. In: Proceedings of INFOCOM (2002)

  20. Parno, B., Perrig, A., Gligor, V.: Distributed detection of node replication attacks in sensor networks. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 49–63 (2005)

  21. Sastry, N., Shankar, U., Wagner, D.: Secure verification of location claims. In: Proceedings of ACM WiSe (2003)

  22. Waters B.R., Felten E.W. (2003) Secure, private proofs of location. Technical Report TR-667-03, Princeton

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering Department, Arizona State University, Tempe, AZ, 85287, USA

    Rida A. Bazzi & Goran Konjevod

Authors
  1. Rida A. Bazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Goran Konjevod
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rida A. Bazzi.

Additional information

The second author was supported in part by the NSF Grant CCR-0209138.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bazzi, R.A., Konjevod, G. On the establishment of distinct identities in overlay networks. Distrib. Comput. 19, 267–287 (2007). https://doi.org/10.1007/s00446-006-0012-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-006-0012-y

Keywords

Search

Navigation