Investigating the OpenPGP web of trust

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6879 LNCS, Issue , 2011, Pages 489-507

  Ulrich, Alexander ^a   Holz, Ralph ^b   Hauck, Peter ^a   Carle, Georg ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Community Structure; GnuPG; OpenPGP; PGP; Web of Trust

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMMUNITY STRUCTURES; COMPONENT PROPERTIES; DATA SET; GNUPG; GRAPH TOPOLOGY; OPENPGP; PGP; PROPERTY; STRONGLY CONNECTED COMPONENT; WEB OF TRUST;

TOPOLOGY;

EID: 80052978579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23822-2_27     Document Type: Conference Paper

References (27)

1. Callas, J., Donnerhacke, L., Finney, H., Shaw, D., Thayer, R.: OpenPGP Message Format. RFC 4880 (November 2007)
2. Perlman, R.: An overview of PKI trust models. IEEE Network 13(6), 38-43 (1999)
3. Maurer, U.: Modelling a public-key infrastructure. In: Martella, G., Kurth, H., Montolivo, E., Hwang, J. (eds.) ESORICS 1996. LNCS, vol. 1146, pp. 325-350. Springer, Heidelberg (1996)
4. Eckersley, P., Burns, J.: An observatory for the SSLiverse. Talk at Defcon 18 (July 2010), https://www.eff.org/files/DefconSSLiverse.pdf (online; last retrieved in February 2011)
5. Pastor-Satorras, R., Vázquez, A., Vespignani, A.: Dynamical and correlation properties of the Internet. Phys. Rev. Lett. 87(25), 258701 (2001)
6. Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208701 (2002)
7. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167-256 (2003)
8. Albert, R., Jeong, H., Barabasi, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378-382 (2000)
9. Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. SIAM Review 51(4), 661-703 (2009)
10. Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A., Arenas, A.: Models of social networks based on social distance attachment. Phys. Rev. E 70(5), 056122 (2004)
11. Capkun, S., Buttyán, L., Hubaux, J.P.: Small Worlds in security systems: an analysis of the PGP certificate graph. In: NSPW 2002: Proc. 2002 Workshop on New Security Paradigms, pp. 28-35. ACM, New York (2002)
12. Li, L., Alderson, D., Doyle, J.C., Willinger, W.: Towards a theory of scale-free graphs: Definition, properties, and implications. Internet Mathematics 2(4), 431-523 (2005)
13. Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Phys. Rev. E 68(3), 036122 (2003)
14. Fortunato, S.: Community detection in graphs. Physics Reports 486(3-5), 75-174 (2010)
15. Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. National Academy of Sciences 105(4), 1118-1123 (2008)
16. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008(10), 10008 (2008)
17. Gregory, S.: Finding overlapping communities in networks by label propagation. New Journal of Physics 12(10), 103018 (2010)
18. Lancichinetti, A., Fortunato, S.: Community detection algorithms: A comparative analysis. Phys. Rev. E 80(5), 056117 (2009)
19. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)
20. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)
21. Sotirov, A., Stevens, M., Appelbaum, J., Lenstra, A., Molnar, D., Osvik, D.A., de Weger, B.: MD5 considered harmful today (2008), http://dl. packetstormsecurity.net/papers/attack/md5-considered-harmful.pdf (online; last retrieved in May 2011)
22. NIST: Approved Algorithms (2006), http://csrc.nist.gov/groups/ST/toolkit/ secure-hashing.html (online; last retrieved in May 2011)
23. Kleinjung, T., Aoki, K., Franke, J., Lenstra, A., Thom, E., Bos, J., Gaudry, P., Kruppa, A., Montgomery, P., Osvik, D., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333-350. Springer, Heidelberg (2010)
24. Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: NIST special publication 800-57 part 1, recommendation for key management - part 1: General (revised) (2007), http://csrc.nist.gov/groups/ST/toolkit/key-management.html
25. Cederlöf, J.: Web of Trust statistics and pathfinder, http://www.lysator.liu.se/~jc/wotsap/ (online; last retrieved in February 2011)
26. Penning, H.P.: Analysis of the strong set in the PGP web of trust, http://pgp.cs.uu.nl/plot/ (online; last retrieved in February 2011)
27. Brinkmeier, M., Schank, T.: Network statistics. Network Analysis, 293-317 (2004)