Skip to main content

Symbolic Partial Model Checking for Security Analysis

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2776))

Abstract

In this paper, we present a symbolic version of the Hennessy-Milner logic for expressing security properties. The models of the logic are CryptoCCS processes with their symbolic semantics. We study the model checking problem and partial model checking techniques for the logic.

Work partially supported by Microsoft Research Europe (Cambridge); by MIUR project “MEFISTO”; by MIUR project “ Tecniche e strumenti software per l’analisi della sicurezza delle comunicazioni in applicazioni telematiche di interesse economico e sociale”; by CNR project “Strumenti, ambienti ed applicazioni innovative per la società dell’informazione” and finally by CSP with the project “SeTAPS”.

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. Basu, S., Ramakrishnan, C.: Compositional analysis for verification of parameterized systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 315–330. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM (1985)

    Google Scholar 

  3. Ingólfsdóttir, A., Lin, H.: A symbolic approach to value-passing processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 427–478. North- Holland, Amsterdam (2001)

    Chapter  Google Scholar 

  4. Kindred, D., Wing, J.M.: Fast, automatic checking of security protocols. In: Second USENIX Workshop on Electronic Commerce, Oakland, California, pp. 41–52 (1996)

    Google Scholar 

  5. Lowe, G.: Breaking and fixing the Needham Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147–166. Springer, Heidelberg (1996)

    Google Scholar 

  6. Marchignoli, D., Martinelli, F.: Automatic verification of cryptographic protocols through compositional analysis techniques. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, p. 148. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Martinelli, F.: Encoding several authentication properties as properties of the intruder’s knowledge. Tech. Rep. IAT-B4-2001-20. Submitted for publication

    Google Scholar 

  8. Martinelli, F.: Symbolic semantics and analysis for crypto-ccs with (almost) generic inference systems. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 519–531. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Martinelli, F.: Formal Methods for the Analysis of Open Systems with Applications to Security Properties. PhD thesis, University of Siena (December 1998)

    Google Scholar 

  10. Martinelli, F.: Languages for description and analysis of authentication protocols. In: Proceedings of 6th ICTCS, pp. 304–315. World Scientific, Singapore (1998)

    Google Scholar 

  11. Martinelli, F.: Analysis of security protocols as open systems. Theoretical Computer Science 290(1), 1057–1106 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Martinelli, F., Petrocchi, M., Vaccarelli, A.: PaMoChSA: A tool for verification of security protocols based on partial model checking. In: Tool Demo at the 1st International School on Formal Methods for the Design of Computer, Communication and Software Systems: Process Algebras (2001)

    Google Scholar 

  13. Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  14. Ryan, P., Schneider, S., Goldsmith, M., Lowe, G., Roscoe, B.: The Modelling and Analysis of Security Protocols: the CSP Approach. Addison-Wesley, Reading (2000)

    Google Scholar 

  15. Schneider, S.: Verifying authentication protocols with CSP. In: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  16. Stirling, C.: Modal and temporal logics for processes. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 149–237. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martinelli, F. (2003). Symbolic Partial Model Checking for Security Analysis . In: Gorodetsky, V., Popyack, L., Skormin, V. (eds) Computer Network Security. MMM-ACNS 2003. Lecture Notes in Computer Science, vol 2776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45215-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45215-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40797-3

  • Online ISBN: 978-3-540-45215-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics