Communications of the ACM
Practical multi-candidate election system
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Choosing reputable servents in a P2P network
Proceedings of the 11th international conference on World Wide Web
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A reputation-based trust model for peer-to-peer ecommerce communities [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Trust and Reputation Model in Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
A Protocol for Reputation Management in Super-Peer Networks
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
A survey of trust and reputation systems for online service provision
Decision Support Systems
Addressing common vulnerabilities of reputation systems for electronic commerce
Journal of Theoretical and Applied Electronic Commerce Research
Targeted and scalable information dissemination in a distributed reputation mechanism
Proceedings of the seventh ACM workshop on Scalable trusted computing
Building a reputation-based bootstrapping mechanism for newcomers in collaborative alert systems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In this paper, we describe SuperTrust, a novel framework designed to handle trust relationships in Super peer networks. What distinguishes SuperTrust from other contributions is that trust reports remain encrypted and are never opened during the submission or aggregation processes, thus guaranteeing privacy and anonymity of transactions. As reputations of peers influence their future interactions, we argue that such systems must have properties like fairness and soundness, persistence, eligibility and unreusability of reports, similar to the properties of current electronic voting systems. SuperTrust is a decentralized protocol, based on K-redundant Super peer networks, that guarantees the aforementioned properties and is in some sense complementary to the models proposed for building trust among peers. Additionally the framework is very efficient and minimizes the effects of collusion of malicious Super peers/aggregators. We have tested the framework on a large subset of peers and demonstrated via simulations its superior performance when compared to the other proposed protocols.