ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

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)
  • Received : 2011.11.11
  • Accepted : 2011.01.10
  • Published : 2011.10.31
Download PDF
⟨ Previous Next ⟩

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

References

  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. https://doi.org/10.1109/TNET.2008.923723
  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. https://doi.org/10.1109/TNET.2009.2034047
  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. https://doi.org/10.1145/362686.362692
  7. D. Guo et al., "The Dynamic Bloom Filters," IEEE Trans. Knowl. Data Eng., vol. 22, no. 1, 2010, pp. 120-133. https://doi.org/10.1109/TKDE.2009.57
  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.

Cited by

  1. Fast 2D filter with low false positive for network packet inspection vol.6, pp.6, 2011, https://doi.org/10.1049/iet-net.2017.0055
  2. Approaches for Improving Bloom Filter-Based Set Membership Query vol.15, pp.3, 2019, https://doi.org/10.3745/jips.04.0116