Repelling Sybil-Type Attacks in Wireless Ad Hoc Systems

  • Marek Klonowski
  • Michał Koza
  • Mirosław Kutyłowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6168)


We consider ad hoc wireless networks and adversaries that try to gain control over the network by Sybil attacks, that is by emulating more physical nodes that are really under his control.We present the first defense method that works for the case when the adversary controls more than one device and these devices have some prior agreement on strategy executed and share preloaded secrets.


Sensor Network Hash Function Physical Device Sybil Attack Defense Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    IEEE 802.11 wireless local area networks, [cited February 14, 2010]
  2. 2.
    Bordim, J.L., Ito, Y., Nakano, K.: Randomized leader election protocols in noisy radio networks with a single transceiver. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 246–256. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Shields, C., Levine, B.N., Boris Margolin, N.: A survey of solutions to the sybil attack (2006),
  4. 4.
    Levine, B.N., Piro, C., Shields, C.: Detecting the sybil attack in ad hoc networks. In: Proc. IEEE/ACM SecureComm., pp. 1–11 (2006)Google Scholar
  5. 5.
    Danezis, G., Lesniewski-Laas, C., Frans Kaashoek, M., Anderson, R.J.: Sybil-resistant dht routing. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 305–318. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Douceur, J.R.: The sybil attack. In: Druschel, P., Frans Kaashoek, M., Rowstron, A.I.T. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Golebiewski, Z., Klonowski, M., Koza, M., Kutylowski, M.: Towards fair leader election in wireless networks. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 166–179. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Hayashi, T., Nakano, K., Olariu, S.: Randomized initialization protocols for packet radio networks. In: IPPS/SPDP, p. 544. IEEE Computer Society, Los Alamitos (1999)Google Scholar
  9. 9.
    Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley, Chichester (2000)zbMATHGoogle Scholar
  10. 10.
    Janson, S., Szpankowski, W.: Analysis of an asymmetric leader election algorithm. Electr. J. Comb. 4(1) (1997)Google Scholar
  11. 11.
    Metcalfe, R.M., Boggs, D.R.: Ethernet: distributed packet switching for local computer networks. Commun. ACM 19(7), 395–404 (1976)CrossRefGoogle Scholar
  12. 12.
    Nakano, K., Olariu, S.: Randomized o (log log n)-round leader election protocols in packet radio networks. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 209–218. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  13. 13.
    Newsome, J., Shi, E., Song, D.X., Perrig, A.: The sybil attack in sensor networks: analysis & defenses. In: Ramchandran, K., Sztipanovits, J., Hou, J.C., Pappas, T.N. (eds.) IPSN, pp. 259–268. ACM, New York (2004)CrossRefGoogle Scholar
  14. 14.
    Perrig, A., Stankovic, J.A., Wagner, D.: Security in wireless sensor networks. Commun. ACM 47(6), 53–57 (2004)CrossRefGoogle Scholar
  15. 15.
    Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15(2), 468–477 (1986)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Marek Klonowski
    • 1
  • Michał Koza
    • 1
  • Mirosław Kutyłowski
    • 1
  1. 1.Institute of Mathematics and Computer ScienceWrocław University of Technology 

Personalised recommendations