Matrix powers algorithms for trust evaluation in PKI architectures

Abstract : This paper deals with the evaluation of trust in public-key infrastructures. Different trust models have been proposed to interconnect the various PKI components in order to propagate the trust between them. In this paper we provide a new polynomial algorithm using linear algebra to assess trust relationships in a network using different trust evaluation schemes. The advantages are twofold: first the use of matrix computations instead of graph algorithms provides an optimized computational solution; second, our algorithm can be used for generic graphs, even in the presence of cycles. Our algorithm is designed to evaluate the trust using all existing (finite) trust paths between entities as a preliminary to any exchanges between PKIs. This can give a precise evaluation of trust, and accelerate for instance cross-certificate validation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00607478
Contributor : Jean-Guillaume Dumas <>
Submitted on : Friday, July 27, 2012 - 11:25:54 AM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Friday, December 16, 2016 - 3:33:29 AM

Files

pkitrust.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00607478, version 4
  • ARXIV : 1107.1880

Collections

Citation

Jean-Guillaume Dumas, Hicham Hossayni. Matrix powers algorithms for trust evaluation in PKI architectures. STM 2012 - 8th International Workshop on Security and Trust Management (co-ESORICS 2012), Sep 2012, Pise, Italy. pp16. ⟨hal-00607478v4⟩

Share

Metrics

Record views

441

Files downloads

2181