Solving Sybil Attacks Using Evolutionary Game Theory
Title | Solving Sybil Attacks Using Evolutionary Game Theory |
Publication Type | Conference Paper |
Year of Publication | 2016 |
Authors | Saab, Farah, Kayssi, Ayman, Elhajj, Imad, Chehab, Ali |
Conference Name | Proceedings of the 31st Annual ACM Symposium on Applied Computing |
Publisher | ACM |
Conference Location | New York, NY, USA |
ISBN Number | 978-1-4503-3739-7 |
Keywords | composability, Evolutionary Game Theory, evolutionary stable strategies, Metrics, pubcrawl, recommender systems, replicator dynamics, Resiliency, Sybil attack, sybil attacks |
Abstract | Recommender systems have become quite popular recently. However, such systems are vulnerable to several types of attacks that target user ratings. One such attack is the Sybil attack where an entity masquerades as several identities with the intention of diverting user ratings. In this work, we propose evolutionary game theory as a possible solution to the Sybil attack in recommender systems. After modeling the attack, we use replicator dynamics to solve for evolutionary stable strategies. Our results show that under certain conditions that are easily achievable by a system administrator, the probability of an attack strategy drops to zero implying degraded fitness for Sybil nodes that eventually die out. |
URL | http://doi.acm.org/10.1145/2851613.2851848 |
DOI | 10.1145/2851613.2851848 |
Citation Key | saab_solving_2016 |