PGP contacts graph [ETH Zurich] Link

catalogued by

List of edges of a snapshot of Pretty-Good-Privacy algorithm's web of trust as it was on July 2001. Only bidirectional signatures (i.e., peers who have mutually signed their keys) have been considered. This filtering process guarantees mutual knowledge between connected peers and makes the PGP network a reliable proxy of the underlying social network. The complete undirected network is composed by 57243 vertices with an average degree =2.16. The giant component (GC) of this network, i.e., the largest connected subnetwork, (which is the data actually provided) comprises 10680 vertices and its average degree is GC=4.55.

Dataset Download

Related Publications