TY - GEN
T1 - SuperTrust - A secure and efficient framework for handling trust in super peer networks
AU - Dimitriou, Tassos
AU - Karame, Ghassan
AU - Christou, Ioannis
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=39149088969&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:39149088969
SN - 3540774432
SN - 9783540774433
VL - 4904 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 350
EP - 362
BT - Distributed Computing and Networking - 9th International Conference, ICDCN 2008, Proceedings
T2 - 9th International Conference on Distributed Computing and Networking, ICDCN 2008
Y2 - 5 January 2008 through 8 January 2008
ER -