Paper 2013/014

On formal and automatic security verification of WSN transport protocols

Ta Vinh Thong and Amit Dvir


In this paper, we address the problem of formal and automated security verification of WSN transport protocols that may perform cryptographic operations. The verification of this class of protocols is difficult because they typically consist of complex behavioral characteristics, such as real-time, probabilistic, and cryptographic operations. To solve this problem, we propose a probabilistic timed calculus for cryptographic protocols, and demonstrate how to use this formal language for proving security or vulnerability of protocols. The main advantage of the proposed language is that it supports an expressive syntax and semantics, including bisimilarities that supports real-time, probabilistic, and cryptographic issues at the same time. Hence, it can be used to verify the systems that involve these three property in a more convenient way. In addition, we propose an automatic verification method, based on the well-known PAT process analysis toolkit, for this class of protocols. For demonstration purposes, we apply the proposed manual and automatic proof methods for verifying the security of DTSN and SDTP, which are two of the recently proposed WSN tranport protocols.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. This work has NOT been published anywhere
SecurityCryptographic protocolFormal verificationAutomated verificationProbabilistic Timed Calculus
Contact author(s)
thong @ crysys hu
2014-01-26: last of 5 revisions
2013-01-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ta Vinh Thong and Amit Dvir},
      title = {On formal and automatic security verification of WSN transport protocols},
      howpublished = {Cryptology ePrint Archive, Paper 2013/014},
      year = {2013},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.