Abstract
Detecting Sybil identities is important to operate a distributed system without losing its openness property. Recently, OSN(Online Social Network) based Sybil detection methods are proposed and an individual node can determine whether other nodes are Sybil or not. However, since the probabilistic properties of the previous methods, single verifier based Sybil detection may suffer from the wide variance in the performance of detecting Sybil nodes. In this paper, multi-verifier based Sybil detection method is proposed to mitigate the variance. The proposed method selects honest verifiers from a social network graph where honest and Sybil nodes are mixed. Then, the method determines whether a node is Sybil or not by comparing the likelihood of acceptance of the node and a given threshold. Through the extensive evaluation with the real-world social network sample graph, the proposed multi-verifier based Sybil detection outperforms the single verifier based Sybil detection in both aspects of accepting honest nodes and suppressing Sybil nodes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Danezis, G., Lesniewski-laas, C., Kaashoek, M.F., Anderson, R.: Sybil-resistant DHT routing. In: de Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 305–318. Springer, Heidelberg (2005)
Sirivianos, M., Kim, K., Gan, J.W., Yang, X.: Assessing the Veracity of Identity Assertions via OSNs. In: Proc. COMSNETS 2012, Bangalore, India, January 3-7 (2012)
Sirivianos, M., Kim, K., Yang, X.: SocialFilter: Introducing Social Trust to Collaborative Spam Mitigation. In: Proc. IEEE INFOCOM 2011, Shanghai, China, April 10-15 (2011)
von Ahn, L., Blum, M., Hopper, N.J., Langford, J.: CAPTCHA: Using Hard AI Problems for Security. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 294–311. Springer, Heidelberg (2003)
Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks. In: Proc. IEEE S&P 2008, Oakland, CA (May2008)
Viswanath, B., Post, A., Gummadi, K.P., Mislove, A.: An Analysis of Social Network-Based Sybil Defenses. In: Proc. SIGCOMM 2010 (2010)
Kim, K.: Sybil-Resistant Trust Value of Social Network Graph. In: Proc. the First International Conference on Smart Media and Applications (SMA 2012), Kunming, Yunnan, China, August 21-24 (2012)
Mohaisen, A., Hopper, N., Kim, Y.: Keep your friends close: Incorporating trust into social network-based Sybil defenses. In: Proc. IEEE INFOCOM 2011, Shanghai, China, April 10-15 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, K. (2014). Using Multiple Verifiers to Detect Sybils in a Social Network Graph. In: Park, J., Stojmenovic, I., Choi, M., Xhafa, F. (eds) Future Information Technology. Lecture Notes in Electrical Engineering, vol 276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40861-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-40861-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40860-1
Online ISBN: 978-3-642-40861-8
eBook Packages: EngineeringEngineering (R0)