Formal Security Verification of Transport Protocols for Wireless Sensor Networks

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 282)


In this paper, we address the problem of formal security verification of transport protocols for wireless sensor networks (WSN) that perform cryptographic operations. Analyzing this class of protocols is a difficult task because they typically consist of complex behavioral characteristics, such as launching timers, performing probabilistic behavior, and cryptographic operations. Some of the recently published WSN transport protocols are DTSN, which does not include cryptographic security mechanism, and two of its secured versions, SDTP and STWSN. In our previous work, we formally analyzed the security of Distributed Transport for Sensor Networks (DTSN) and Distributed Transport Protocol for Wireless Sensor Networks (SDTP), and showed that they are vulnerable against packet modification attacks. In another work we proposed a new Secure Transport Protocol for WSNs (STWSN), with the goal of eliminating the vulnerability of DTSN and SDTP, however, its security properties have only been informally argued. In this paper, we apply formal method to analyze the security of STWSN.


Wireless Sensor Network Data Packet Intermediate Node Transport Protocol Message Authentication Code 
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.
    Dvir, A., Buttyán, L., Ta, V.-T.: SDTP+: Securing a distributed transport protocol for wsns using merkle trees and hash chains. In: IEEE International Confenrence on Communications (ICC), Budapest, Hungary, pp. 1–6 (June 2013)Google Scholar
  2. 2.
    Yicka, J., Mukherjeea, B., Ghosal, D.: Wireless sensor network survey. Computer Networks 52(12), 2292–2330 (2008)CrossRefGoogle Scholar
  3. 3.
    Wang, C., Sohraby, K., Li, B., Daneshmand, M., Hu, Y.: A survey of transport protocols for wireless sensor networks. Network 20(3), 34–40 (2006)Google Scholar
  4. 4.
    Buttyán, L., Csik, L.: Security analysis of reliable transport layer protocols for wireless sensor networks. In: IEEE Workshop on Sensor Networks and Systems for Pervasive Computing, Mannheim, Germany, pp. 1–6 (March 2010)Google Scholar
  5. 5.
    Marchi, B., Grilo, A., Nunes, M.: DTSN - distributed transport for sensor networks. In: IEEE Symposium on Computers and Communications, Aveiro, Portugal, pp. 165–172 (July 2007)Google Scholar
  6. 6.
    Buttyán, L., Grilo, A.M.: A Secure Distributed Transport Protocol for Wireless Sensor Networks. In: IEEE International Conference on Communications, Kyoto, Japan, pp. 1–6 (June 2011)Google Scholar
  7. 7.
    Ta, V.-T., Dvir, A.: On formal and automatic security verification of wsn transport protocols. ISRN Sensor Networks (December 2013) (accepted)Google Scholar
  8. 8.
    Merkle, R.C.: Protocols for Public Key Cryptosystems. In: Symposium on Security and Privacy, California, USA, pp. 122–134 (April 1980)Google Scholar
  9. 9.
    Coppersmith, D., Jakobsson, M.: Almost optimal hash sequence traversal. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 102–119. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Galuba, W., Papadimitratos, P., Poturalski, M., Aberer, K., Despotovic, Z., Kellerer, W.: Castor: Scalable Secure Routing for Ad-Hoc Networks. In: Infocom, Rio de Janeiro, Brazil, pp. 1–9 (2010)Google Scholar
  11. 11.
    Hu, Y.-C., Perrig, A., Johnson, D.B.: Ariadne: a secure on-demand routing protocol for ad hoc networks. Wireless Networks Journal 11(1-2), 21–38 (2005)CrossRefGoogle Scholar
  12. 12.
    Fournet, C., Abadi, M.: Mobile values, new names, and secure communication. In: ACM Symposium on Principles of Programming, pp. 104–115 (2001)Google Scholar
  13. 13.
    Goubault-Larrecq, J., Palamidessi, C., Troina, A.: A probabilistic applied pi–calculus. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 175–190. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  14. 14.
    D’Argenio, P.R., Brinksma, E.: A calculus for timed automata. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 110–129. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  15. 15.
    Ta, V.-T., Dvir, A.: On formal and automatic security verification of wsn transport protocols. Cryptology ePrint Archive, Report 2013/014 (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.INRIA, CITI/INSA-LyonVilleurbanneFrance
  2. 2.BMELaboratory of Cryptography and System Security (CrySyS)BudapestHungary
  3. 3.MTA-BME Information Systems Research GroupBudapestHungary
  4. 4.The College of Management - Academic StudiesComputer Science SchoolRishon LeZionIsrael

Personalised recommendations