Walking the web of trust

被引:59
作者
Caronni, G [1 ]
机构
[1] Sun Microsyst Inc, Labs, Palo Alto, CA 94303 USA
来源
IEEE 9TH INTERNATIONAL WORKSHOPS ON ENABLING TECHNOLOGIES: INFRASTRUCTURE FOR COLLABORATIVE ENTERPRISES, PROCEEDINGS | 2000年
关键词
web of trust; PKI; heuristic trust calculation;
D O I
10.1109/ENABL.2000.883720
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Most currently deployed Public Key Infrastructures (PKIs) are hierarchically oriented and rely on a centralized design. Hierarchical PKIs may be appropriate solutions for many usage-scenarios, but there exists the viable alternative of the 'Web of Trust'. In a web of trust, each user of the system can choose for himself whom he elects to trust, and whom not. After contrasting the properties of web-of-trust based PKIs to those of hierarchical PKIs, an introduction to webs of trust and to quantitative trust calculations is given. The paper concludes with the presentation of an efficient, sub-exponential algorithm that allows heuristic computations of trust paths in a web of trust.
引用
收藏
页码:153 / 158
页数:4
相关论文
共 14 条
  • [1] Albitz P., 1992, DNS BIND
  • [2] CARONNI G, 1996, 5 WORKSH EN TECHN WE
  • [3] CARONNI G, 1999, THESIS ETH ZURICH
  • [4] *IETF, 1987, 1033 IETF RFC
  • [5] *IETF, 1993, 1510 IETF RFC
  • [6] *IETF, 1997, 2065 IETF RFC
  • [7] *IETF, 1993, 1421 IETF RFC
  • [8] LIEBL A, 1993, AUTHENTICATION DISTR
  • [9] MAURER U, 1996, LECT NOTES COMPUTER, V1046, P387
  • [10] MAURER U, 1996, ESORICS 96