Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols

Electronic Notes in Theoretical Computer Science

Volumn 61, Issue , 2002, Pages 154-177

  Lafrance, Stéphane ^a   Mullins, John ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; CRYPTOGRAPHY; DATABASE SYSTEMS; SEMANTICS; SYSTEMS ANALYSIS;

BISIMULATION-BASED NON-DETERMINISTIC ADMISSIBLE INTERFERENCE (BNAI); CRYTOGRAPHIC PROTOCOLS; NON INTERFERENCE-BASED METHODS; OBSERVATION EQUIVALENCE;

INFORMATION ANALYSIS;

EID: 4944237116     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00311-1     Document Type: Conference Paper

References (26)

1. Abadi M., Burrows M., Needham R. A logic of authentication. ACM Transactions on Computer Systems. 8:(1):1990;18-36
2. Abadi M., Gordon A.D. Reasoning about cryptographic protocols in the spi calculus. CONCUR'97: Concurrency Theory, volume 1243. 1997;59-73 Springer-Verlag, Berlin, Germany
3. Abadi M., Gordon A.D. A bisimulation method for cryptographic protocols. Nordic Journal of Computing. 5:(4):Winter 1998;267-303
4. Bodei C., Degano P., Nielson F., Nielson H. Static analysis for the π-calculus with applications to security. Information and Computation. 2001;. (to appear)
5. Boreale M., De Nicola R., Pugliese R. Proof techniques for cryptographic processes. Logic in Computer Science. 1999;157-166
6. Boudol G. Notes on algebraic calculi of processes. Logic and Models of Concurrent Systems, NATO ASI Series F-13. 1985;261-303 Springer
7. Cleaveland R., Parrow J., Steffen B. The concurrency workbench: a semantics based tool for the verification of concurrent processes. ACM Transactions on Programming Languages and Systems. 15:(1):January 1993;36-72
8. A. Durante, R. Focardi, and R. Gorrieri. CVS: A compiler for the analysis of cryptographic protocols. In Proceedings of 12th IEEE Computer Security Foundations Workshop. IEEE Computer Society, June 1999.
9. R. Focardi, A. Ghelli, and R. Gorrieri. Using non interference for the analysis of security protocols. In H. Orman and C. Meadows, editors, Proceeding of the DIMACS Workshop on Design and Formal Verification of Security Protocols, Rutgers University, September 1997. DIMACS Center.
10. Focardi R., Gorrieri R. A classification of security properties for process algebras. J. of Computer Security. 3:(1):1994/1995;5-33
11. R. Focardi, R. Gorrieri, and F. Martinelli. Secrecy in security protocols as non interference. In S. Schneider and P. Ryan, editors, Proceedings of DERA/RHUL Workshop on Secure Architectures and Information Flow, volume 32. Elsevier ENTCS, 2000.
12. R. Focardi and F. Martinelli. A uniform approach for the definition of security properties. In Proc. of World Congress on Formal Methods (FM'99), Springer, LNCS 1708, pages 794-813, 1999.
13. J.A. Goguen and J. Meseguer. Unwinding and inference control. In Proceedings of the IEEE Symp. on Research in Security and Privacy, pages 75-285, Oakland, CA, 1984. IEEE Computer Society.
14. Y. Hirshfeld and F. Moller. Decidability results in automata and process theory. In F. Moller and G. Birthwistle, editors, Logic for Concurrency: Structure versus Automata, volume 1043 of LNCS, pages 102-148. Springer, 1996.
15. Kannellakis P., Smolka S. Ccs expressions, finite state processes and three problems of equivalence. Information and Computation. 86:1990;333-354
16. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proc. of TACAS'96, volume 1055 of LNCS, pages 147-166. Springer-Verlag, 1996.
17. McLean J. Security models. Marciniak J. Encyclopedia of Software Engineering. 1994;1136-1145 John Wyley & Sons
18. Milner R. Communication and concurrency. 1989;Prentice-Hall
19. Mullins J. Nondeterministic admissible interference. Journal of Universal Computer Science. 6:(11):2000;1054-1070
20. S. Pinsky. Absorbing covers and intransitive non-interference. In Proceedings of the IEEE Symp. on Research in Security and Privacy, pages 102-113, Oakland, CA, May 1995. IEEE Computer Society.
21. Roscoe A.W. Modelling and verifying key-exchange using CSP and FDR. 8th Computer Security Foundation Workshop. 1995;IEEE Computer Society Press
22. Schneider S. Verifying authentication protocols in CSP. IEEE Transactions of Software Engineering. 24:(8):1998;447-479
23. C. Stirling. Decidability of bisimulation equivalence for pushdown processes. unpublished, 2000.
24. C. Stirling. Decidability of DPDA equivalence. Technical Report LFCS99-411, University of Edinburgh, 2000. to appear in Theoretical Computer Science.
25. Woo T., Lam S. Authentication for distributed systems. IEEE Computer. 25:(1):January 1992;39-52
26. Woo T.Y.C., Lam S.S. A lesson in authentication protocol design. ACM Operating Systems Review. 28:(3):1994