Skip to main content

Checking Secrecy by Means of Partial Order Reduction

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3319))

Abstract

We propose a partial order reduction for model checking security protocols for the secrecy property. Based on this reduction, we develop an automatic tool that can check security protocols for secrecy, given a finite execution scenario. We compare this tool to several other tools.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Clark, J., Jacob, J.: A survey of authentication protocol literature. Technical Report 1.0 (1997)

    Google Scholar 

  2. Clarke, E., Jha, S., Marrero, W.: Partial order reductions for security protocol verification. Tools and Algorithms for the Construction and Analysis of Systems. Volume 1785 of Lecture Notes in Computer Science, Springer (2000) 503–518

    Chapter  Google Scholar 

  3. Corin, R., Etalle, S.: An improved constraint-based system for the verification of security protocols. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 326–341. Springer, Heidelberg (2002), http://www.ub.utwente.nl/webdocs/ctit/1/00000096.pdf

    Chapter  Google Scholar 

  4. Cremers, C.: Scyther documentation (2004), http://www.win.tue.nl/~ccremers/scyther

  5. Cremers, C., Mauw, S., de Vink, E.: Defining authentication in a trace model. In: Dimitrakos, T., Martinelli, F. (eds.) FAST 2003 Proceedings of the first international Workshop on Formal Aspects in Security and Trust, Pisa, IITT-CNR technical report, pp. 131–145 (2003)

    Google Scholar 

  6. Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory IT-29, 198–208 (1983)

    Article  MathSciNet  Google Scholar 

  7. Lowe, G.: Casper: A compiler for the analysis of security protocols. In: Proc. 10th Computer Security Foundations Workshop, pp. 18–30. IEEE, Los Alamitos (1997)

    Chapter  Google Scholar 

  8. Lowe, G.: A hierarchy of authentication specifications. In: Proc. 10th Computer Security Foundations Workshop, pp. 31–44. IEEE, Los Alamitos (1997)

    Chapter  Google Scholar 

  9. Mauw, S., Bos, V.: Drawing Message Sequence Charts with LATEX. TUGBoat 22, 87–92 (2001)

    Google Scholar 

  10. Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: ACM Conference on Computer and Communications Security, pp. 166–175 (2001)

    Google Scholar 

  11. Peled, D.: Ten years of partial order reduction. In: Proceedings of the 10th International Conference on Computer Aided Verification, pp. 17–28. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cremers, C.J.F., Mauw, S. (2005). Checking Secrecy by Means of Partial Order Reduction. In: Amyot, D., Williams, A.W. (eds) System Analysis and Modeling. SAM 2004. Lecture Notes in Computer Science, vol 3319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31810-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31810-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24561-2

  • Online ISBN: 978-3-540-31810-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics