Paper #: 4.3.2.2
Title: TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems

1. Problems
-Maintaining anonymity while trying to dynamically and automatically rank nodes according to their transactions is difficut. Also, persisting the rankings as nodes leave and enter the network is difficult.

2. New Idea and Strengths
-This proposal suggests a collection of encrypted key pairs in order to make anonymous transaction reporting possible. Pairs of nodes interact, then look for a "Trust-Holding Agent" that records transaction qualities for the other node. The THA will hold the encryption key, preventing any malicious messaging intent on damaging nodes' reputation.
-By decentralizing the trust holding, as other nodes who have participated in transactions leave the network, the trust for the original node remains unchanged.
-The metrics of the trust rating are completely flexible, so this protocal can be integrated with many systems.

3. Weaknesses and Extensions
-I don't see why peers can't maintain a list of their own THA peers. This would eliminate the broadcast cost, and it seems like the encryption keys would prevent this from causing any security issues.
-I had hoped the "persistence" would apply to nodes mainting their trust levels after leaving and re-entering the network. As it stands now, you could almost have a trusted server maintaing trust values for nodes rather than keeping the values in THA's.
-Obviously scalability is a big issue with system. Maybe applying the notion of trust values as a variable when deciding which nodes to select as neighbors in a more traditional p2p system would be more practical than just checking for hits on every query, although this is for a DHT system, so what I just said won't really apply.