Analysing the BKE-security Protocol with μcRL

Electronic Notes in Theoretical Computer Science

Volumn 139, Issue 1, 2005, Pages 49-90

  Blom, Stefan ^a   Groote, Jan Friso ^a,b   Mauw, Sjouke ^a,b   Serebrenik, Alexander ^b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

CRL; Model checking; Security protocol verification

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS;

Μ CRL; DISTRIBUTED SYSTEMS; MODEL CHECKING; SECURITY PROTOCOL VERIFICATION;

SECURITY OF DATA;

EID: 27644432767     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.09.005     Document Type: Conference Paper

References (36)

1. J.A. Bergstra, and J.W. Klop Algebra of communicating processes with abstraction Theoretical Computer Science 37 1985 77 121
2. S. Blom, and J. van de Pol State space reduction by proving confluence E. Brinksma K.G. Larsen Computer Aided Verification, 14th International Conference, Proceedings CAV 2002, Copenhagen, Denmark, July 27-31, 2002 Lecture Notes in Computer Science 2404 2002 596 609
3. E. Brinksma A tutorial on LOTOS M. Diaz Protocol Specification, Testing and Verification V, Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification Toulouse-Moissac, France, June 10-13, 1985 1985 171 194
4. M. Burrows, M. Abadi, and R.M. Needham A logic of authentication ACM Transactions on Computer Systems 8 1990 18 36
5. Clark, J.A. and J.L. Jacob, A survey of authentication protocol literature, Technical Report 1.0, The University of York (1997)
6. E.M. Clarke, O. Grumberg, and D.E. Long Verification tools for finite-state concurrent systems J.W. de Bakker W.P. de Roever G. Rozenberg A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium, Proceedings Noordwijkerhout, The Netherlands, June 1-4, 1993 Lecture Notes in Computer Science 803 1994 124 175
7. E.M. Clarke, S. Jha, and W.R. Marrero Partial order reductions for security protocol verification S. Graf M.I. Schwartzbach Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, Proceedings ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000 Lecture Notes in Computer Science 1785 2000 503 518
8. C.J.F. Cremers, and S. Mauw Checking secrecy by means of partial order reduction D. Amyot A.W. Williams System Analysis and Modeling, 4th International SDL and MSCWorkshop SAM 2004, Ottawa, Canada, June 1-4, 2004, Revised Selected Papers Lecture Notes in Computer Science 3319 2004 171 188
9. David, A., G. Behrmann, K. Larsen and W. Yi, A tool architecture for the next generation of UPPAAL, Technical report, Uppsala University (2003)
10. D. Dolev, and A.C.-C. Yao On the security of public key protocols IEEE Transactions on Information Theory 29 1983 198 207
11. H. Garavel, F. Lang, and R. Mateescu An overview of CADP 2001 European Association for Software Science and Technology (EASST) Newsletter 4 2002 13 24
12. J.F. Groote, and A. Ponse Process algebra with guards: Combining hoare logic with process algebra Formal Aspects of Computing 6 1994 115 164
13. J.F. Groote, and M.A. Reniers Algebraic process verification J.A. Bergstra A. Ponse S.A. Smolka Handbook of Process Algebra 2001 Elsevier 1151 1208
14. J.F. Groote, and M.P.A. Sellink Confluence for process verification Theoretical Computer Science 170 1996 47 81
15. J.F. Groote, and J. van de Pol Equational binary decision diagrams M. Parigot A. Voronkov Logic for Programming and Automated Reasoning, 7th International Conference, Proceedings LPAR 2000, Reunion Island, France, November 11-12, 2000 Lecture Notes in Computer Science 1955 2000 161 178
16. Groote, J.F. and T. Willemse, A checker for modal formulas for processes with data, Theoretical Computer Science (2005), to appear
17. G.J. Holzmann The SPIN model checker: Primer and reference manual 2003 Addison-Wesley
18. G. Lowe Breaking and fixing the Needham-Schroeder public-key protocol using FDR T. Margaria B. Steffen Tools and Algorithms for Construction and Analysis of Systems, Second International Workshop, Proceedings TACAS '96, Passau, Germany, March 27-29, 1996 Lecture Notes in Computer Science 1055 1996 147 166
19. G. Lowe A hierarchy of authentication specification 10th Computer Security Foundations Workshop (CSFW '97), June 10-12, 1997, Rockport, Massachusetts, USA 1997 31 44
20. S. Mauw, and H. Mulder Regularity of BPA-systems is decidable B. Jonsson J. Parrow CONCUR '94, Concurrency Theory, 5th International Conference, Proceedings Uppsala, Sweden, August 22-25, 1994 Lecture Notes in Computer Science 836 1994 34 47
21. S. Mauw, and G.J. Veltink A process specification formalism Fundamenta Informaticae 13 1990 85 139
22. C. Meadows The nrl protocol analyzer: An overview Journal of Logic Programming 26 1996 113 131
23. Millen, J.K. and V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis., in: ACM Conference on Computer and Communications Security, 2001, pp. 166-175
24. R. Milner Communication and concurrency 1989 Prentice Hall
25. Mitchell, J.C., M. Mitchell and U. Stern, Automated analysis of cryptographic protocols using murφ., in: Proceedings of IEEE Symposium on Security and Privacy (1997), pp. 141-151
26. F. Moller, and P. Stevens The Edinburgh concurrency workbench user manual 2005 University of Edinburgh
27. L.C. Paulson The inductive approach to verifying cryptographic protocols Journal of Computer Security 6 1998 85 128
28. P. Ryan, M. Schneider, S. Goldsmith, G. Lowe, and B. Roscoe Modelling and Analysis of Security Protocols 2000 Addison-Wesley
29. D.X. Song, S. Berezin, and A. Perrig Athena: A novel approach to efficient automatic security protocol analysis Journal of Computer Security 9 2001 47 74
30. A. Stump, C.W. Barrett, and D.L. Dill CVC: A cooperating validity checker E. Brinksma K.G. Larsen Computer Aided Verification, 14th International Conference, Proceedings CAV 2002, Copenhagen, Denmark, July 27-31, 2002 Lecture Notes in Computer Science 2404 2002 500 504
31. Thayer, F.J., J.C. Herzog and J.D. Guttman, Strand spaces: Why is a security protocol correct, in: Proceedings of IEEE Symposium on Security and Privacy (1998), pp. 160-171
32. Usenko, Y.S., "Linearization in μCRL," Ph.D. thesis, Eindhoven University of Technology (2002)
33. J. van de Pol JITty: A rewriter with strategy annotations S. Tison Rewriting Techniques and Applications, 13th International Conference, Proceedings RTA 2002, Copenhagen, Denmark, July 22-24, 2002 Lecture Notes in Computer Science 2378 2002 367 370
34. J. van de Pol, and M.V. Espada Modal abstractions in μCRL C. Rattray S. Maharaj C. Shankland Algebraic Methodology and Software Technology, 10th International Conference, Proceedings AMAST 2004, Stirling, Scotland, UK, July 12-16, 2004 Lecture Notes in Computer Science 3116 2004 409 425
35. R.J. van Glabbeek, and W.P. Weijland Branching time and abstraction in bisimulation semantics Journal of the ACM 43 1996 555 600
36. F. van Ham, H. van de Wetering, and J.J. van Wijk Interactive visualization of state transition systems IEEE Transitions on Visualisation and Computer Graphics 8 2002 319 329