• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

SybilLimit: A nearoptimal social network defense against sybil attacks

Cached

  • Download as a PDF

Download Links

  • [www.comp.nus.edu.sg]
  • [www.cs.utexas.edu]
  • [www0.comp.nus.edu.sg]
  • [www.comp.nus.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.comp.nus.edu.sg]
  • [www.cs.utexas.edu]
  • [www.comp.nus.edu]
  • [www.cs.utexas.edu]
  • [www0.comp.nus.edu.sg]
  • [www.comp.nus.edu.sg]
  • [www.comp.nus.edu]
  • [www0.comp.nus.edu.sg]
  • [www.comp.nus.edu]
  • [www.pittsburgh.intel-research.net]
  • [www.cs.nyu.edu]
  • [www.cs.nyu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Haifeng Yu , Phillip B. Gibbons , Michael Kaminsky , Feng Xiao
Venue:2008 [Online]. Available: http://www.comp.nus.edu.sg/~yuhf/sybillimit-tr.pdf
Citations:212 - 7 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Yu_sybillimit:a,
    author = {Haifeng Yu and Phillip B. Gibbons and Michael Kaminsky and Feng Xiao},
    title = {SybilLimit: A nearoptimal social network defense against sybil attacks},
    booktitle = {2008 [Online]. Available: http://www.comp.nus.edu.sg/~yuhf/sybillimit-tr.pdf},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abstract—Open-access distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user creates multiple fake identities (called sybil nodes). Without a trusted central authority that can tie identities to real human beings, defending against sybil attacks is quite challenging. Among the small number of decentralized approaches, our recent SybilGuard protocol leverages a key insight on social networks to bound the number of sybil nodes accepted. Despite its promising direction, SybilGuard can allow a large number of sybil nodes to be accepted. Furthermore, SybilGuard assumes that social networks are fast-mixing, which has never been confirmed in the real world. This paper presents the novel SybilLimit protocol that leverages the same insight as SybilGuard, but offers dramatically improved and near-optimal guarantees. The number of sybil nodes accepted is reduced by a factor of 2 ( p n), or around 200 times in our experiments for a million-node system. We further prove that SybilLimit’s guarantee is at most a log n factor away from optimal when considering approaches based on fast-mixing social networks. Finally, based on three large-scale real-world social networks, we provide the first evidence that real-world social networks are indeed fast-mixing. This validates the fundamental assumption behind SybilLimit’s and SybilGuard’s approach. Index Terms—Social networks, sybil attack, sybil identities, SybilGuard, SybilLimit. I.

Keyphrases

sybil attack    nearoptimal social network defense    sybil node    social network    index term social network    million-node system    promising direction    real human being    trusted central authority    peer-to-peer system    large-scale real-world social network    log factor    fast-mixing social network    large number    malicious user    real-world social network    sybil identity    real world    first evidence    multiple fake identity    key insight    small number    abstract open-access    decentralized approach    novel sybillimit protocol    fundamental assumption    recent sybilguard protocol    sybillimit guarantee    near-optimal guarantee   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University