On the semantics of Alice&Bob specifications of security protocols

Theoretical Computer Science

Volumn 367, Issue 1-2, 2006, Pages 88-122

  Caleiro, Carlos ^a   Viganò, Luca ^b   Basin, David ^b  

^a CLC   (Portugal)

^b ETH ZURICH   (Switzerland)

Author keywords

Alice Bob specifications; Message sequences; Protocol models; Security protocols; Spi calculus

Indexed keywords

CODES (STANDARDS); DATA STRUCTURES; DATA TRANSFER; PATTERN MATCHING; SECURITY OF DATA; SEMANTICS;

DENOTATIONAL SEMANTICS; MESSAGE SEQUENCES; PROTOCOL MODELS; SECURITY PROTOCOLS;

NETWORK PROTOCOLS;

EID: 33750486827     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.08.041     Document Type: Article

References (42)

1. Abadi M., and Gordon A.D. A calculus for cryptographic protocols: the spi calculus. Inform. Comput. 148 (1999) 1-70
2. Abadi M., and Rogaway P. Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology 15 2 (2002) 103-127
3. A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Heám, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Viganò, L. Vigneron, The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications, in: Proc. CAV'05, Lecture Notes in Computer Science, Vol. 3576, Springer, Berlin, 2005, pp. 281-285.
4. A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna, S. Mödersheim, M. Rusinowitch, M. Turuani, L. Viganò, L. Vigneron, The AVISS security protocol analysis tool, in: Proc. CAV'02, Lecture Notes in Computer Science, Vol. 2404, Springer, Berlin, 2002, pp. 349-354.
5. N. Asokan, V. Shoup, M. Waidner, Asynchronous protocols for optimistic fair exchange, in: Proc. IEEE Symp. on Research in Security and Privacy, IEEE Computer Society Press, Silver Spring, MD, 1998, pp. 86-99.
6. D. Basin, G. Denker, Maude versus Haskell: an experimental comparison in security protocol analysis, in: Proc. WRLA'00, ENTCS, Vol. 36, 2001, pp. 235-256.
7. Basin D., Mödersheim S., and Viganò L. OFMC: a symbolic model checker for security protocols. Internat. J. Inform. Security 4 3 (2005) 181-208
8. B. Blanchet, An efficient cryptographic protocol verifier based on prolog rules, in: Proc. CSFW'01, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 82-96.
9. Bodei C., Buchholtz M., Degano P., Nielson F., and Riis Nielson H. Static validation of security protocols. J. Comput. Security 13 3 (2005) 347-390
10. M. Boreale, M.G. Buscemi, A framework for the analysis of security protocols, in: Proc. CONCUR 2002, Lecture Notes in Computer Science, Vol. 2421, Springer, Berlin, 2002, pp. 483-498.
11. S. Brackin, C. Meadows, J. Millen, CAPSL interface for the NRL protocol analyzer, in: Proc. ASSET'99, IEEE Computer Society Press, Silver Spring, MD, 1999.
12. S. Briais, U. Nestmann, A formal semantics for protocol narrations, in: Proc. TGC'05, Lecture Notes in Computer Science, Vol. 3705, Springer, Berlin, 2005, pp. 163-181.
13. Buchholtz M., Riis Nielson H., and Nielson F. A calculus for control flow analysis of security protocols. Internat. J. Inform. Security 2 3-4 (2004) 145-167
14. C. Caleiro, L. Viganò, D. Basin, Deconstructing Alice and Bob, in: Proc. ARSPA'05, ENTCS, Vol. 135(1), 2005, pp. 3-22.
15. C. Caleiro, L. Viganò, D. Basin, Metareasoning about security protocols using distributed temporal logic, in: Proc. ARSPA'04, ENTCS, Vol. 125(1), 2005, pp. 67-89.
16. Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, J. Mantovani, S. Mödersheim, L. Vigneron, A high level protocol specification language for industrial security-sensitive protocols, in: Proc. SAPS'04, Austrian Computer Society, 2004, pp. 193-205.
17. Chevalier Y., Küsters R., Rusinowitch M., and Turuani M. An NP decision procedure for protocol insecurity with XOR. Theor. Comput. Sci. 338 1-3 (2005) 247-274
18. J. Clark, J. Jacob, A survey of authentication protocol literature: version 1.0, 17. November 1997, URL: 〈www.cs.york.ac.uk/~jac/papers/ www.drareview.ps.gz〉.
19. H. Comon-Lundh, V. Shmatikov, Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, in: Proc. LICS'03, IEEE Computer Society Press, Silver Spring, MD, 2003.
20. R. Corin, S. Etalle, An improved constraint-based system for the verification of security protocols, in: Proc. SAS'02, Lecture Notes in Computer Science, Vol. 2477, Springer, Berlin, 2002.
21. F. Crazzolara, G. Winskel, Composing strand spaces, in: Proc. FST TCS 2002, Lecture Notes in Computer Science, Vol. 2556, Springer, Berlin, 2002, pp. 97-108.
22. C. Cremers, Scyther documentation, 〈http://www.win.tue.nl/~ccremers/scyther〉.
23. Damm W., and Harel D. LSCs: breathing life into message sequence charts. Formal Methods in System Design 19 1 (2001) 45-80
24. G. Denker, J. Millen, H. Rueß, The CAPSL integrated protocol environment, Technical Report SRI-CSL-2000-02, SRI International, Menlo Park, CA, 2000.
25. Dolev D., and Yao A. On the security of public key protocols. IEEE Trans. Inform. Theory 29 2 (1983) 198-208
26. Durgin N., Mitchell J.C., and Pavlovic D. A compositional logic for proving security properties of protocols. J. Comput. Security 11 (2003) 677-721
27. A.D. Gordon, A. Jeffrey, Authenticity by typing for security protocols, in: Proc. CSFW'01, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 145-159.
28. C. Haack, A. Jeffrey, Pattern-matching spi-calculus, in: Proc. FAST'04, IFIP series 173, Kluwer Academic Press, Dordrecht, 2004, pp. 193-205.
29. Halpern J.Y., and Pucella R. On the relationship between strand spaces and multi-agent systems. ACM Trans. Inform. System Security 6 1 (2003) 43-70
30. ITU-T Recommendation Z.120: Message Sequence Chart (MSC), 2000.
31. F. Jacquemard, M. Rusinowitch, L. Vigneron, Compiling and verifying security protocols, in: Proc. LPAR 2000, Lecture Notes in Computer Science, Vol. 1955, Springer, Berlin, 2000, pp. 131-160.
32. Lowe G. Casper: a compiler for the analysis of security protocols. J. Comput. Security 6 1 (1998) 53-84
33. S. Mauw, M. Reniers, T. Willemse, Message sequence charts in the software engineering process, in: Handbook of Software Engineering and Knowledge Engineering, World Scientific Publishing Co., Singapore, 2001, pp. 437-463.
34. Meadows C. Formal methods for cryptographic protocol analysis: emerging issues and trends. IEEE J. Sel. Areas Comm. 21 1 (2003) 44-54
35. Paulson L. The inductive approach to verifying cryptographic protocols. J. Comput. Security 6 (1998) 85-128
36. Rivest R.L., Shamir A., and Adleman L.M. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 21 2 (1978) 120-126
37. Rumbaugh P., Jacobson I., and Booch G. The Unified Modeling Language Reference Manual (1999), Addison-Wesley, Reading, MA
38. Ryan P., Schneider S., Goldsmith M., Lowe G., and Roscoe B. Modelling and Analysis of Security Protocols (2000), Addison-Wesley, Reading, MA
39. Song D., Berezin S., and Perrig A. Athena: a novel approach to efficient automatic security protocol analysis. J. Comput. Security 9 (2001) 47-74
40. Thayer Fábrega F.J., Herzog J.C., and Guttman J.D. Strand spaces: proving security protocols correct. J. Comput. Security 7 (1999) 191-230
41. L. Viganò, Automated security protocol analysis with the AVISPA tool, in: Proc. MFPS'05, ENTCS, Vol. 155, 2006, pp. 61-86.
42. Wikipedia: Alice and Bob, URL: 〈www.wikipedia.org/wiki/Alice_and_Bob〉.