Small worlds in security systems: An analysis of the PGP certificate graph

Srdjan Čapkun, L. Buttyán, Jean Pierre Hubaux

Research output: Conference contribution

55 Citations (Scopus)

Abstract

We propose a new approach to securing self-organized mobile ad hoc networks. In this approach, security is achieved in a fully self-organized manner; by this we mean that the security system does not require any kind of certification authority or centralized server, even for the initialization phase. In our work, we were inspired by PGP [15] because its operation relies solely on the acquaintances between users. We show that the small-world phenomenon naturally emerges in the PGP system as a consequence of the self-organization of users. We show this by studying the PGP certificate graph properties and by quantifying its small-world characteristics. We argue that the certificate graphs of self-organized security systems will exhibit a similar small-world phenomenon, and we provide a way to model self-organized certificate graphs. The results of the PGP certificate graph analysis and graph modelling can be used to build new self-organized security systems and to test the performance of the existing proposals. In this work, we refer to such an example.

Original languageEnglish
Title of host publicationProceedings New Security Paradigms Workshop
EditorsC.F. Hempelmann, V. Raskin
Pages28-35
Number of pages8
Publication statusPublished - 2002
EventProceedings New Security Paradigms Workshop 2002 - Virginia Beach, VA, United States
Duration: szept. 23 2002szept. 26 2002

Other

OtherProceedings New Security Paradigms Workshop 2002
CountryUnited States
CityVirginia Beach, VA
Period9/23/029/26/02

Fingerprint

Security systems
Mobile ad hoc networks
Servers

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Čapkun, S., Buttyán, L., & Hubaux, J. P. (2002). Small worlds in security systems: An analysis of the PGP certificate graph. In C. F. Hempelmann, & V. Raskin (Eds.), Proceedings New Security Paradigms Workshop (pp. 28-35)

Small worlds in security systems : An analysis of the PGP certificate graph. / Čapkun, Srdjan; Buttyán, L.; Hubaux, Jean Pierre.

Proceedings New Security Paradigms Workshop. ed. / C.F. Hempelmann; V. Raskin. 2002. p. 28-35.

Research output: Conference contribution

Čapkun, S, Buttyán, L & Hubaux, JP 2002, Small worlds in security systems: An analysis of the PGP certificate graph. in CF Hempelmann & V Raskin (eds), Proceedings New Security Paradigms Workshop. pp. 28-35, Proceedings New Security Paradigms Workshop 2002, Virginia Beach, VA, United States, 9/23/02.
Čapkun S, Buttyán L, Hubaux JP. Small worlds in security systems: An analysis of the PGP certificate graph. In Hempelmann CF, Raskin V, editors, Proceedings New Security Paradigms Workshop. 2002. p. 28-35
Čapkun, Srdjan ; Buttyán, L. ; Hubaux, Jean Pierre. / Small worlds in security systems : An analysis of the PGP certificate graph. Proceedings New Security Paradigms Workshop. editor / C.F. Hempelmann ; V. Raskin. 2002. pp. 28-35
@inproceedings{9db1df8290e842c2aaee988e626b6b74,
title = "Small worlds in security systems: An analysis of the PGP certificate graph",
abstract = "We propose a new approach to securing self-organized mobile ad hoc networks. In this approach, security is achieved in a fully self-organized manner; by this we mean that the security system does not require any kind of certification authority or centralized server, even for the initialization phase. In our work, we were inspired by PGP [15] because its operation relies solely on the acquaintances between users. We show that the small-world phenomenon naturally emerges in the PGP system as a consequence of the self-organization of users. We show this by studying the PGP certificate graph properties and by quantifying its small-world characteristics. We argue that the certificate graphs of self-organized security systems will exhibit a similar small-world phenomenon, and we provide a way to model self-organized certificate graphs. The results of the PGP certificate graph analysis and graph modelling can be used to build new self-organized security systems and to test the performance of the existing proposals. In this work, we refer to such an example.",
keywords = "PGP, Public-key management, Self-organization, Small-world gaps",
author = "Srdjan Čapkun and L. Butty{\'a}n and Hubaux, {Jean Pierre}",
year = "2002",
language = "English",
pages = "28--35",
editor = "C.F. Hempelmann and V. Raskin",
booktitle = "Proceedings New Security Paradigms Workshop",

}

TY - GEN

T1 - Small worlds in security systems

T2 - An analysis of the PGP certificate graph

AU - Čapkun, Srdjan

AU - Buttyán, L.

AU - Hubaux, Jean Pierre

PY - 2002

Y1 - 2002

N2 - We propose a new approach to securing self-organized mobile ad hoc networks. In this approach, security is achieved in a fully self-organized manner; by this we mean that the security system does not require any kind of certification authority or centralized server, even for the initialization phase. In our work, we were inspired by PGP [15] because its operation relies solely on the acquaintances between users. We show that the small-world phenomenon naturally emerges in the PGP system as a consequence of the self-organization of users. We show this by studying the PGP certificate graph properties and by quantifying its small-world characteristics. We argue that the certificate graphs of self-organized security systems will exhibit a similar small-world phenomenon, and we provide a way to model self-organized certificate graphs. The results of the PGP certificate graph analysis and graph modelling can be used to build new self-organized security systems and to test the performance of the existing proposals. In this work, we refer to such an example.

AB - We propose a new approach to securing self-organized mobile ad hoc networks. In this approach, security is achieved in a fully self-organized manner; by this we mean that the security system does not require any kind of certification authority or centralized server, even for the initialization phase. In our work, we were inspired by PGP [15] because its operation relies solely on the acquaintances between users. We show that the small-world phenomenon naturally emerges in the PGP system as a consequence of the self-organization of users. We show this by studying the PGP certificate graph properties and by quantifying its small-world characteristics. We argue that the certificate graphs of self-organized security systems will exhibit a similar small-world phenomenon, and we provide a way to model self-organized certificate graphs. The results of the PGP certificate graph analysis and graph modelling can be used to build new self-organized security systems and to test the performance of the existing proposals. In this work, we refer to such an example.

KW - PGP

KW - Public-key management

KW - Self-organization

KW - Small-world gaps

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

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

M3 - Conference contribution

AN - SCOPUS:0242456134

SP - 28

EP - 35

BT - Proceedings New Security Paradigms Workshop

A2 - Hempelmann, C.F.

A2 - Raskin, V.

ER -