skip to main content
10.1145/2714576.2714606acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article

Social Networks Meet Distributed Systems: Towards a Robust Sybil Defense under Churn

Published: 14 April 2015 Publication History

Abstract

This paper examines the impact of heavy churn on the robustness of decentralized social network-based Sybil defense (SNSD) schemes. Our analysis reveals that (i) heavy churn disintegrates the social overlay network that is fundamental to these schemes into multiple disconnected components, resulting in poor network connectivity, and (ii) a naive solution that adds links from each node to all its 2-hop neighbors improves network connectivity but comes at a significant cost of poor attack resilience of these schemes.
We propose a new design point in the trade-off between network connectivity and attack resilience of SNSD schemes, where each node adds links to only a selective few of all its 2-hop neighbors based on a minimum expansion contribution (MinEC) heuristic. Extensive evaluation through simulations shows that our approach fares as good as the naive 2-hop solution in terms of network connectivity, while making little compromise on the attack resilience. Moreover, our approach preserves the fast-mixing property that is fundamental to many SNSD schemes even at high levels of churn. This result suggests that existing and potential future SNSD schemes relying on this property can incorporate our approach into their designs with minimal changes.

References

[1]
Skype. http://www.skype.com/.
[2]
Skype 5.0: Remastered for iphone. http://blogs.skype.com/2014/06/09/skype-5-0-remastered-for-iphone/.
[3]
Skype statistics. http://share.skype.com/stats_rss.xml/.
[4]
Snap network analysis library. http://snap.stanford.edu/.
[5]
Topics in theoretical computer science: An algorithmist's toolkit; lecture 6. http://ocw.mit.edu/courses/mathematics/18-409-topics-in-theoretical-computer-science-an-algorithmists-toolkit-fall-2009/lecture-notes/MIT18_409F09_scribe6.pdf/.
[6]
Yahoo! instant messenger. https://messenger.yahoo.com/.
[7]
Yahoo! messenger client to server protocol-level events, version 1.0. http://research.yahoo.com/Academic_Relations/.
[8]
Yahoo! messenger user communication pattern. http://research.yahoo.com/Academic_Relations/.
[9]
A. L. Barabási and R. Albert. Emergence of scaling in random networks. Science, pages 509--12, 1999.
[10]
R. Bhagwan, S. Savage, and G. Voelker. Understanding availability. IPTPS '03.
[11]
N. Chiluka, N. Andrade, D. Gkorou, and J. Pouwelse. Personalizing eigentrust in the face of communities and centrality attack. AINA '12.
[12]
N. Chiluka, N. Andrade, J. Pouwelse, and H. Sips. Leveraging trust and distrust for sybil-tolerant voting in online social media. PSOSM '12.
[13]
G. Danezis and P. Mittal. Sybilinfer: Detecting sybil nodes using social networks. In NDSS '09.
[14]
J. R. Douceur. The sybil attack. IPTPS '01.
[15]
P. Erdos and A. Rényi. On the evolution of random graphs. Bull. Inst. Internat. Statist, 38(4):343--347, 1961.
[16]
T. Isdal, M. Piatek, A. Krishnamurthy, and T. Anderson. Privacy-preserving p2p data sharing with oneswarm. SIGCOMM '10.
[17]
R. B. Jennings, E. M. Nahum, D. P. Olshefski, D. Saha, Z.-Y. Shae, and C. Waters. A study of internet instant messaging and chat protocols. Netwrk. Mag. of Global Internetwkg., 20(4):16--21.
[18]
C. Lesniewski-Laas and M. F. Kaashoek. Whanau: a sybil-proof distributed hash table. NSDI '10.
[19]
D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03.
[20]
A. S. Maiya and T. Y. Berger-Wolf. Sampling community structure. WWW '10.
[21]
P. Mittal, M. Caesar, and N. Borisov. X-vine: Secure and pseudonymous routing using social networks. In NDSS '12.
[22]
M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. 2005.
[23]
A. Mohaisen, N. Hopper, and Y. Kim. Keep your friends close: Incorporating trust into social network-based sybil defenses. INFOCOM '11.
[24]
A. Mohaisen, H. Tran, N. Hopper, and Y. Kim. On the mixing time of directed social graphs and security implications. ASIACCS '12.
[25]
S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a dht. ATEC '04.
[26]
D. Stutzbach and R. Rejaie. Understanding churn in peer-to-peer networks. IMC '06.
[27]
D. N. Tran, J. Li, L. Subramanian, and S. S. M. Chow. Optimal sybil-resilient node admission control. In INFOCOM '11.
[28]
E. Vasserman, R. Jansen, J. Tyra, N. Hopper, and Y. Kim. Membership-concealing overlay networks. CCS '09.
[29]
B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. WOSN '09.
[30]
B. Viswanath, A. Post, K. P. Gummadi, and A. Mislove. An analysis of social network-based sybil defenses. SIGCOMM '10.
[31]
H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. Sybillimit: A near-optimal social network defense against sybil attacks. IEEE SP '08.
[32]
H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybilguard: defending against sybil attacks via social networks. SIGCOMM '06.

Cited By

View all
  • (2024)Integration of the Triple Block Data Security Model Based on Distributed Crypto-Steganography in a ClusterResearch in Computer Science10.1007/978-3-031-63110-8_15(180-190)Online publication date: 28-Jun-2024
  • (2022)RunMax: fake profile classification using novel nonlinear activation in CNNSocial Network Analysis and Mining10.1007/s13278-022-00983-912:1Online publication date: 27-Oct-2022
  • (2021)A novel spam detection technique for detecting and classifying the malicious profiles in online social networksJournal of Intelligent & Fuzzy Systems10.3233/JIFS-202937(1-15)Online publication date: 5-Jul-2021
  • Show More Cited By

Index Terms

  1. Social Networks Meet Distributed Systems: Towards a Robust Sybil Defense under Churn

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ASIA CCS '15: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security
    April 2015
    698 pages
    ISBN:9781450332453
    DOI:10.1145/2714576
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 14 April 2015

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. churn
    2. social overlay network
    3. sybil attack

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    ASIA CCS '15
    Sponsor:
    ASIA CCS '15: 10th ACM Symposium on Information, Computer and Communications Security
    April 14 - March 17, 2015
    Singapore, Republic of Singapore

    Acceptance Rates

    ASIA CCS '15 Paper Acceptance Rate 48 of 269 submissions, 18%;
    Overall Acceptance Rate 418 of 2,322 submissions, 18%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 15 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Integration of the Triple Block Data Security Model Based on Distributed Crypto-Steganography in a ClusterResearch in Computer Science10.1007/978-3-031-63110-8_15(180-190)Online publication date: 28-Jun-2024
    • (2022)RunMax: fake profile classification using novel nonlinear activation in CNNSocial Network Analysis and Mining10.1007/s13278-022-00983-912:1Online publication date: 27-Oct-2022
    • (2021)A novel spam detection technique for detecting and classifying the malicious profiles in online social networksJournal of Intelligent & Fuzzy Systems10.3233/JIFS-202937(1-15)Online publication date: 5-Jul-2021
    • (2016)Centralized to Decentralized Social NetworksManaging and Processing Big Data in Cloud Computing10.4018/978-1-4666-9767-6.ch003(37-54)Online publication date: 2016
    • (2015)Detecting Clusters of Fake Accounts in Online Social NetworksProceedings of the 8th ACM Workshop on Artificial Intelligence and Security10.1145/2808769.2808779(91-101)Online publication date: 16-Oct-2015

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media