Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
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.