Trust Path Discovery
draft-ono-trust-path-discovery-02
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Kumiko Ono , Henning Schulzrinne | ||
Last updated | 2006-06-28 | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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
Henning Schulzrinne
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)