Re: [Simple] New draft on trust_path_discovery

[Jonathan Rosenberg <[e-mail]>]

This is a very interesting draft. This kind of presence-based reputation 
system is definitely a strong contender for a piece of the anti-spam 
puzzle.

Building a protocol to do this is very challenging. One of the design 
decisions is whether or not it is pushed based, akin to a vector routing 
protocl (as you have proposed) or whether it is query-based. I am 
concerned that a push-based routing protocol type of solution is simply 
not going to scale, as the level of aggregation will not be sufficient. 
Though there is a form of aggregation, in terms of combining paths to 
the same recipient, there is no way to aggregate decisions across 
recipients. The latter is analagous to combining prefixes in BGP, and 
that is not possible here since the identifiers are from a flat namespace.

Furthermore, I may not want to reveal all of my trust relationships to 
everyone, indeed, I may not want to reveal the same trust relationships 
to different people. Consider this example. I have a buddy list with 
lots of buddies on it. Those buddies include colleagues from work, 
family, and certain business associates that I deal with, but 
confidentially (example: the business development manager from a company 
about to acquire my company). I don't want everyone I trust to actually 
know that I trust this biz dev guy, since that reveals confidential 
information.

Because of this, I think that these trust chains need to be query based. 
Indeed, care must be taken to make sure the privacy issues I mention 
above can be dealt with. Indeed, if you allow transitive queries - user 
A queries B that queries C, it can get really hard to preserve the 
privacy needed.

Thanks,
Jonathan R.


Kumiko Ono wrote:

> Hi all,
> 
> Henning and I wrote up the I-D that proposes a mechanism to find friends
> -of-friends and trusted domains, which could be used as a tool to 
> protect users from spam/spit. We could not find any WG that this draft 
> should belong to, but we believe the SIPPING/SIMPLE WG might be 
> interested in this draft. Any comments are welcome.
> 
> 
> 
>>	Title		: Trust Path Discovery
>>	Author(s)	: K. Ono, H. Schulzrinne
>>	Filename	: draft-ono-trust-path-discovery-00.txt
>>	Pages		: 14
>>	Date		: 2005-7-12
>>	
>>  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 out 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 relatively low-value trust
>>  establishment, suitable for deciding whether to accept communication
>>  requests such as emails, calls, or instant messages from strangers.
>>
>>A URL for this Internet-Draft is:
>>http://www.ietf.org/internet-drafts/draft-ono-trust-path-discovery-00.txt
> 
> 
> Thanks,
> Kumiko
> 
> 
> _______________________________________________
> Simple mailing list
> [e-mail]
> https://www1.ietf.org/mailman/listinfo/simple
> 

-- 
Jonathan D. Rosenberg, Ph.D.                   600 Lanidex Plaza
Director, Service Provider VoIP Architecture   Parsippany, NJ 07054-2711
Cisco Systems
[e-mail]                              FAX:   [phone]
http://www.jdrosen.net                         PHONE: [phone]
http://www.cisco.com

_______________________________________________
Simple mailing list
[e-mail]
https://www1.ietf.org/mailman/listinfo/simple