TY - GEN
T1 - Sybil detection via distributed sparse cut monitoring
AU - Kurve, Aditya
AU - Kesidis, George
PY - 2011
Y1 - 2011
N2 - Decentralized reputation systems help to enforce discipline and fairness in large unstructured and ad-hoc systems by rewarding good behavior and penalizing dishonest or greedy behavior. They are essential in large networks of independent nodes where centralized monitoring of node behavior is difficult due to the sheer size of the network. Sybil nodes pose a threat to the reputation systems by false referrals through sybil identities. We propose a scalable and distributed algorithm to identify attack edges and quarantine sybil clusters. This algorithm works well with dynamic trust graphs as nodes do not need to store any pre-computed data.
AB - Decentralized reputation systems help to enforce discipline and fairness in large unstructured and ad-hoc systems by rewarding good behavior and penalizing dishonest or greedy behavior. They are essential in large networks of independent nodes where centralized monitoring of node behavior is difficult due to the sheer size of the network. Sybil nodes pose a threat to the reputation systems by false referrals through sybil identities. We propose a scalable and distributed algorithm to identify attack edges and quarantine sybil clusters. This algorithm works well with dynamic trust graphs as nodes do not need to store any pre-computed data.
UR - http://www.scopus.com/inward/record.url?scp=80052163217&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052163217&partnerID=8YFLogxK
U2 - 10.1109/icc.2011.5963402
DO - 10.1109/icc.2011.5963402
M3 - Conference contribution
AN - SCOPUS:80052163217
SN - 9781612842332
T3 - IEEE International Conference on Communications
BT - 2011 IEEE International Conference on Communications, ICC 2011
T2 - 2011 IEEE International Conference on Communications, ICC 2011
Y2 - 5 June 2011 through 9 June 2011
ER -