Browse > Article
http://dx.doi.org/10.4218/etrij.11.0210.0431

SybilBF: Defending against Sybil Attacks via Bloom Filters  

Wu, Hengkui (Science and Technology on Electronic Test & Measurement Laboratory, The 41st Research Institute of CETC, School of Electronics and Information Engineering, Beijing Jiaotong University)
Yang, Dong (School of Electronics and Information Engineering, Beijing Jiaotong University)
Zhang, Hongke (School of Electronics and Information Engineering, Beijing Jiaotong University)
Publication Information
ETRI Journal / v.33, no.5, 2011 , pp. 826-829 More about this Journal
Abstract
Distributed systems particularly suffer from Sybil attacks, where a malicious user creates numerous bogus nodes to influence the functions of the system. In this letter, we propose a Bloom filter-based scheme, SybilBF, to fight against Sybil attacks. A Bloom filter presents a set of Sybil nodes according to historical behavior, which can be disseminated to at least n (e-1)/e honest nodes. Our evaluation shows that SybilBF outperforms state of the art mechanisms improving SybilLimit by a factor of (1/e)${\gamma}$ at least.
Keywords
Sybil attack; Bloom filter; security;
Citations & Related Records

Times Cited By Web Of Science : 0  (Related Records In Web of Science)
Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 J.R. Douceur, "The Sybil Attack," Proc. 1st Int. Workshop Peerto- Peer Syst., Cambridge, MA, USA, Mar. 2002, pp. 251-260.
2 H. Yu et al., "SybilGuard: Defending against Sybil Attacks via Social Networks," IEEE/ACM Trans. Netw., vol. 16, no. 3, 2008, pp. 576-589.   DOI
3 H. Yu et al., "SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks," IEEE/ACM Trans. Netw., vol. 18, no. 3, 2010, pp. 885-898.   DOI
4 G. Danezis and P. Mittal, "SybilInfer: Detecting Sybil Nodes Using Social Networks," Proc. 16th Netw. Distrib. Syst. Security Symp., San Diego, California, USA, Feb. 2009.
5 N. Tran et al., "Sybil-Resilient Online Content Voting," Proc. 6th USENIX Symp. Netw. Syst. Design Implementation, Boston, MA, USA, Apr. 2009, pp. 15-28.
6 B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Commun. ACM, vol. 13, no. 7, 1970, pp. 422- 426.   DOI
7 D. Guo et al., "The Dynamic Bloom Filters," IEEE Trans. Knowl. Data Eng., vol. 22, no. 1, 2010, pp. 120-133.   DOI
8 J. Leskovec et al., "Statistical Properties of Community Structure in Large Social and Information Networks," Proc. WWW, Beijing, China, Apr. 2008, pp. 695-704.