Trust Path Discovery
draft-ono-trust-path-discovery-02

Document Type Expired Internet-Draft (individual)
Authors Kumiko Ono  , Henning Schulzrinne 
Last updated 2006-06-28
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-ono-trust-path-discovery-02.txt

Abstract

Chained or transitive trust can be used to determine whether incoming communication is likely to be desirable or not. We can build a chained trust relationship by introducing friends to our friends, for example. We propose mechanisms for discovering trust paths and binary responsive trustworthiness. The trust paths are based on a chain of trust relationships between users, a user and a domain, and domains. We apply this model to establishing relatively low-value trust suitable for deciding whether to accept communication requests such as emails, calls, or instant messages from strangers.

Authors

Kumiko Ono (ono.kumiko@lab.ntt.co.jp)
Henning Schulzrinne (hgs+geopriv@cs.columbia.edu)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)