Mean Shortest Distance

Mean Shortest Distance

In statistical analysis of the PGP/GnuPG/OpenPGP Web of trust the mean shortest distance (MSD) is one measurement of how "trusted" a given PGP key is within the "strongly connected" set of PGP keys that make up the Web of trust.

Drew Streib wrote the following in his explanation of keyring analysis [http://dtype.org/keyanalyze/explanation.php] :

:"There are a variety of metrics one could apply to this set, but I've chosen initially to measure the "mean shortest distance" (MSD) to each key. Since every key is reachable from every other in the strong set, it is possible to find out the shortest distance (number of hops) to any given key from any other key. Averaging these distances gives the MSD to that key from every other key in the strong set."

:"It is desirable to have as short as possible an MSD to your key, as that means that on average, people can reach your key quickly through signatures, and thus your key is relatively more trusted than a key with a higher MSD."

:"NOTE: This does not mean that you should universally trust keys with a low MSD. This is merely a relative measurement for statistical purposes."

:"The MSD has the property of being no more than 1 higher than your lowest signature. In the worst case, every key in the strong set could reach you by getting to that key, plus 1 hop to get to you. It also encourages the joining of keys that are separated by great distances in the graph, as it will make you a highway of sorts for shortest paths between keys in those groups. In the end, it encourages an overall tightening of the world graph, shortening distances between key owners. "

MSD has become a common metric for analysis of sets of PGP keys. Very often you will see the MSD being calculated for a given subset of keys and compared with the "global MSD" which generally refers to the keys ranking within one of the larger key analyses of the global Web of trust.

External links

* [http://dtype.org/keyanalyze/explanation.php An explanation of keyring analysis]


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Distance matrices in phylogeny — Distance matrices are used in phylogeny as non parametric distance methods were originally applied to phenetic data using a matrix of pairwise distances. These distances are then reconciled to produce a tree (a phylogram, with informative branch… …   Wikipedia

  • Distance (graph theory) — Geodesic distance redirects here. For distances on the surface of the Earth, see Great circle distance. In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path connecting… …   Wikipedia

  • Web of trust — For the internet security website, see WOT: Web of Trust. In cryptography, a web of trust is a concept used in PGP, GnuPG, and other OpenPGP compatible systems to establish the authenticity of the binding between a public key and its owner. Its… …   Wikipedia

  • MSD — may refer to:* Material Support Division, a division of the Air Force Supply Management arm, with some operations at Warner Robins ALC * Musculoskeletal disorders * Macromolecular Structure Database, one of the services provided by the European… …   Wikipedia

  • MSD — Die Abkürzung MSD steht für: Maschinen und Stahlbau Dresden, Niederlassung der Herrenknecht AG Massenselektiver Detektor, ein Massenspektrometer gekoppelt mit einem Chromatografen wie GC / LC / CE) Master of Security and Defense Management eine… …   Deutsch Wikipedia

  • geometry — /jee om i tree/, n. 1. the branch of mathematics that deals with the deduction of the properties, measurement, and relationships of points, lines, angles, and figures in space from their defining conditions by means of certain assumed properties… …   Universalium

  • Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network …   Wikipedia

  • cosmos — /koz meuhs, mohs/, n., pl. cosmos, cosmoses for 2, 4. 1. the world or universe regarded as an orderly, harmonious system. 2. a complete, orderly, harmonious system. 3. order; harmony. 4. any composite plant of the genus Cosmos, of tropical… …   Universalium

  • relativity — /rel euh tiv i tee/, n. 1. the state or fact of being relative. 2. Physics. a theory, formulated essentially by Albert Einstein, that all motion must be defined relative to a frame of reference and that space and time are relative, rather than… …   Universalium

  • Great circle — For fictional interstellar organization called Great Circle, see Andromeda (novel). A great circle divides the sphere in two equal hemispheres A great circle, also known as a Riemannian circle, of a sphere is the intersection of the sphere and a… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”