Certificate recommendations to improve the robustness of web of trust

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

Volumn 3225, Issue , 2004, Pages 292-303

  Jiang, Qinglin ^a   Reeves, Douglas S ^a   Ning, Peng ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; SECURITY OF DATA;

CERTIFICATE GRAPHS; CERTIFICATES; DISTRIBUTED SYSTEMS; GRAPH AUGMENTATION; GRAPH CONNECTIVITY; NON-COMPLIANCE; PGP KEYRINGS; WEB OF TRUST;

HEURISTIC METHODS;

EID: 35048873384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30144-8_25     Document Type: Article

References (27)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network flows : theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, N.J., 1993.
2. Tuomas Aura. On the structure of delegation networks. In Proc. 11th IEEE Computer Security Foundations Workshop, pages 14-26, Rockport, MA, June 1998. IEEE Computer Society Press.
3. András A. Benczúr. Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems. Discrete Applied Mathematics, 129(2-3):233-262, 2003.
4. Thomas Beth, Malte Borcherding, and Birgit Klein. Valuation of trust in open networks. In Proceeding of the 3rd European Symposium on Research in Computer Security (ESORICS 94), pages 3-18, 1994.
5. Matt Blaze, Joan Feigenbaum, and Jack Lacy. Decentralized trust management. In Proceedings of the 1996 IEEE Symposium on Security and Privacy, pages 164-173, Oakland CA USA, 6-8 May 1996.
6. . Srdjan Capkun, Levente Buttyán, and Jean-Pierre Hubaux. Small worlds in security systems: an analysis of the pgp certificate graph. In Proceedings of the 2002 workshop on New security paradigms, pages 28-35. ACM Press, 2002.
7. Darnell D. Pgp or pki? the future of internet security. EDI Forum: The Journal of Electronic Commerce, 12(1):59-62, 1999.
8. C. Ellison, B. Frantz, B. Lampson, R. Rivest, B. Thomas, and T. Ylonen. RFC 2693: SPKI certificate theory, September 1999.
9. A. Frank. Connectivity augmentation problems in network design. Mathematical Programming: State of the Art 1994, pages 34-63, 1994.
10. A. Frank and T. Jordan. Minimal edge-coverings of pairs of sets. Journal of Combinatorial Theory, Series B, 65(1):73-110, 1995.
11. Andras Frank and Tibor Jordan. Directed vertex-connectivity augmentation. Mathematical Programming, 84(3):537-553, 1999.
12. Frank Harary. Graph Theory. Addison-Wesley, Reading, Mass., 1969.
13. Qinglin Jiang, Douglas S. Reeves, and Peng Ning. Certificate recommendations to improve robustness of webs of trust. Technical Report TR-2004-04, Department of Computer Science, N.C. State University, January 2004.
14. Qinglin Jiang, Douglas S. Reeves, and Peng Ning. Improving robustness of PGP by conflict detection. In The Cryptographers Track at the RSA Conference 2004, volume 2964 of Lecture Notes in Computer Science, pages 194-207. Springer, 2004.
15. Jon Kleinberg. The small-world phenomenon: an algorithm perspective. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 163-170. ACM Press, 2000.
16. R. Levien and A. Aiken. Attack-resistant trust metrics for public key certification. In Proceedings of the Seventh USENIX Security Symposium, 1998.
17. Ueli Maurer. Modelling a public-key infrastructure. In Proceedings of the Fourth European Symposium on Research in Computer Security (ESORICS 96), pages 324-350, 1996.
18. S. Mendes and C. Huitema. A new approach to the X.509 framework: Allowing a global authentication infrastructure without a global trust model. In Proceedings of the Symposium on Network and Distributed System Security, 1995, pages 172-189, San Diego, CA , USA, Feb 1995.
19. M.Grotschel, L.Lovasz, and A.Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorial, 1:169 -197, 1981.
20. Hiroshi Nagamochi and Toshihide Ibaraki. Graph connectivity and its augmentation: applications of ma orderings. Discrete Appl. Math., 123(1-3):447-472, 2002.
21. M. Reiter and S. Stubblebine. Toward acceptable metrics of authentication. In IEEE Symposium on Security and Privacy, pages 10-20, 1997.
22. M. Reiter and S. Stubblebine. Resilient authentication using path independence. IEEE Transactions on Computers, 47(12), December 1998.
23. M. Drew Streib. Keyanalyze - analysis of a large OpenPGP ring. http://www.dtype.org/keyanalyze/.
24. Anas Tarah and Christian Huitema. Associating metrics to certification paths. In Computer Security - ESORICS 92, Second European Symposium on Research in Computer Security, Toulouse, France, November 23-25, 1992, Proceedings, volume 648 of Lecture Notes in Computer Science, pages 175-189. Springer Verlag, 1992.
25. Int'l Telecommunications Union/ITU Telegraph & Tel. ITU-T recommendation X.509: The directory: Public-key and attribute certificate frameworks, Mar 2000.
26. D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, 393:440, 1998.
27. Philip Zimmermann. The official PGP user's guide. MIT Press, Cambridge, Mass., 1995.