Skip to main content
SpringerLink
Log in

Parallel Bounded Model Checking of Security Protocols

  • Conference paper
  • First Online:
Book cover Parallel Processing and Applied Mathematics (PPAM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8384))

Abstract

The verification of security protocols is a difficult process taking into consideration a concept and computations. The difficulties start just during the appropriate adequate protocol specification, and during studying its properties. In case of the computation connected with constructing and searching of the modeling structures of protocol execution and scattered knowledge of the users, the problems are the sizes of those structures. For small values of parameters such as numbers of sessions, users, or encryption keys the proper models are usually not very big, and searching them is not a problem, however in case of increasing the values of the above mentioned parameters, the models are sometimes too big, and there is no possibility to construct them nor search properly. In order to increase the values of studying protocol parameters, and necessary increase the computation effectiveness, the appropriate solutions must be introduced. In the article, the solutions which enable full and effective parallelization of the computations during automatic verification of security protocols are introduced. The suitable experimental results are also presented.

The first author acknowledges the support of the FNR (National Research Fund) Luxembourg under project GALOT – INTER/DFG/12/06. The second and the third author acknowledge that this research was co-financed by the European Union under the European Social Fund. Project PO KL “Information technologies: Research and their interdisciplinary applications”, Agreement UDA-POKL.04.01.01-00-05110-00.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Institutional subscriptions

References

  1. Armando, A., et al.: The avispa tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 281–285. Springer, Heidelberg (2005)

    Google Scholar 

  2. Bella, G., Massacci, F., Paulson, L.C.: Verifying the set registration protocols. IEEE J. Sel. Areas Commun. 20(1), 77–87 (2003)

    Article  Google Scholar 

  3. Bella, G., Paulson, L.C.: Using Isabelle to prove properties of the kerberos authentication system. In: Orman, H., Meadows, C. (eds.) Proceedings of the DIMACS Workshop (1997)

    Google Scholar 

  4. Bobulski, J., Kubanek, M.: Person identification system using an identikit picture of the suspect. Opt. Appl. 42(4), 865–873 (2012)

    Google Scholar 

  5. Cohen, E.: Taps: A first-order verifier for cryptographic protocols. In: CSFW’00: Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSFW’00), p. 144, Washington, DC, USA, IEEE Computer Society (2000)

    Google Scholar 

  6. Comon-Lundh, H., Cortier, V.: Security properties: two agents are sufficient. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 99–113. Springer, Heidelberg (2003)

    Google Scholar 

  7. Cremers, C., Mauw, S.: Operational Semantics and Verification of Security Protocols. Information Security and Cryptography, pp. 1–155. Springer, Berlin (2012)

    MATH  Google Scholar 

  8. Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(2), 198–207 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kacprzak, M., et al.: Verics 2007 - a model checker for knowledge and real-time. Fundam. Inform. 85(1–4), 313–328 (2008)

    MATH  MathSciNet  Google Scholar 

  10. Kurkowski, M., Penczek, W.: Verifying security protocols modeled by networks of automata. Fund. Inform. 79(3–4), 453–471 (2007)

    MATH  MathSciNet  Google Scholar 

  11. Kurkowski, M., Penczek, W.: Verifying timed security protocols via translation to timed automata. Fund. Inform. 93(1–3), 245–259 (2009)

    MATH  MathSciNet  Google Scholar 

  12. Kurkowski, M., Penczek, W.: Applying timed automata to model checking of security protocols. In: Wang, J. (ed.) Handbook of Finite State Based Models and Applications, pp. 223–254. CRC Press, Boca Raton (2012)

    Chapter  Google Scholar 

  13. 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 

  14. Meadows, C.: The nrl protocol analyzer: an overview. J. Logic Program. 26(2), 13–131 (1996)

    Article  Google Scholar 

  15. Needham, R.M., Schroeder, M.D.: Using encryption for authentication in large networks of computers. Commun. ACM 21(12), 993–999 (1978)

    Article  MATH  Google Scholar 

  16. Paulson, L.C.: Inductive analysis of the internet protocol tls. ACM Trans. Inf. Syst. Secur. 2(3), 332–351 (1999)

    Article  Google Scholar 

  17. Siedlecka-Lamch, O., et al.: A New Effective Approach for Modelling and Verification of Security Protocols. In: Proceedings of CS&P’2012 Humboldt University Press, Berlin, Germany, pp. 191–202 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Communication, University of Luxembourg, 6, rue Richard Coudenhove-Kalergi, 1359, Luxembourg, Luxembourg

    Mirosław Kurkowski

  2. Institute of Computer and Information Sciences, Czestochowa University of Technology, Dabrowskiego 73, Czestochowa, Poland

    Mirosław Kurkowski, Olga Siedlecka-Lamch, Sabina Szymoniak & Henryk Piech

Authors
  1. Mirosław Kurkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olga Siedlecka-Lamch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sabina Szymoniak
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Henryk Piech
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mirosław Kurkowski .

Editor information

Editors and Affiliations

  1. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Roman Wyrzykowski

  2. University of Tennessee, Department of Computer Science, Knoxville, Tennessee, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Konrad Karczewski

  4. Technical University of Denmark Informatics and Mathematical Modelling, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurkowski, M., Siedlecka-Lamch, O., Szymoniak, S., Piech, H. (2014). Parallel Bounded Model Checking of Security Protocols. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2013. Lecture Notes in Computer Science(), vol 8384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55224-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55224-3_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-55223-6

  • Online ISBN: 978-3-642-55224-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation