scispace - formally typeset
Proceedings ArticleDOI

Trust relationships in secure systems-a distributed authentication perspective

TLDR
A formalism for expressing trust relations is presented along with an algorithm for deriving trust relations from recommendations, and the advantages of the approach are demonstrated by analyzing and comparing the trust relation requirements of a few known authentication protocols.
Abstract
The notion of trust is fundamental in inter-domain authentication protocols. The goal is to develop an effective formalism for explicit expressions of trust relations between entities involved in authentication protocols. Different relevant types of trust are identified and classified. A formalism for expressing trust relations is presented along with an algorithm for deriving trust relations from recommendations. The advantages of the approach are demonstrated by analyzing and comparing the trust relation requirements of a few known authentication protocols. >

read more

Citations
More filters
Proceedings ArticleDOI

Supporting trust in virtual communities

TL;DR: In this article, a trust model that is grounded in real-world social trust characteristics, and based on a reputation mechanism, or word-of-mouth, is proposed for the virtual medium.
Proceedings ArticleDOI

A distributed trust model

TL;DR: In this article, the authors outline the shortcomings of current security approaches for managing trust and propose a model for trust based on distributed recommendations, which is based on a distributed recommendation system.
Book ChapterDOI

Valuation of Trust in Open Networks

TL;DR: A method for the valuation of trustworthiness which can be used to accept or reject an entity as being suitable for sensitive tasks is presented, an extension of the work of Yahalom, Klein and Beth.
Journal ArticleDOI

Prudent engineering practice for cryptographic protocols

TL;DR: The principles are informal guidelines that complement formal methods, but do not assume them, and are however helpful, in that adherence to them would have avoided a considerable number of published errors.
Book ChapterDOI

Modelling a Public-Key Infrastructure

TL;DR: An approach to modelling and reasoning about a PKI from a user Alice's point of view is proposed, which includes confidence values for statements and can exploit arbitrary certification structures containing multiple intersecting certification paths to achieve a higher confidence value than for any single certification path.
References
More filters
Journal ArticleDOI

A method for obtaining digital signatures and public-key cryptosystems

TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI

A public key cryptosystem and a signature scheme based on discrete logarithms

TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Journal ArticleDOI

Using encryption for authentication in large networks of computers

TL;DR: Use of encryption to achieve authenticated communication in computer networks is discussed and example protocols are presented for the establishment of authenticated connections, for the management of authenticated mail, and for signature verification and document integrity guarantee.
Journal ArticleDOI

A logic of authentication

TL;DR: This paper describes the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication, and gives the results of the analysis of four published protocols.
Book ChapterDOI

A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms

TL;DR: In this article, a new signature scheme is proposed together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem and the security of both systems relies on the difficulty of computing discrete logarithms over finite fields.