A game-theoretic framework for specification and verification of cryptographic protocols

Formal Aspects of Computing

Volumn 22, Issue 5, 2010, Pages 585-609

  Saleh, Mohamed ^a   Debbabi, Mourad ^a  

^a Computer Security Laboratory Concordia Institute for Information Systems Engineering Concordia University ^*  (Canada)

Author keywords

Formal verification; Game semantics; Model checking; Security protocols

Indexed keywords

MODEL CHECKING; NETWORK SECURITY; TREES (MATHEMATICS);

COMPUTATION FUNCTION; CRYPTOGRAPHIC PROTOCOLS; FORMAL VERIFICATIONS; GAME SEMANTICS; MODEL CHECKING ALGORITHM; PROTOCOL DESIGNERS; SECURITY PROTOCOLS; SPECIFICATION AND VERIFICATION;

SEMANTICS;

EID: 84890871230     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-009-0129-4     Document Type: Article

References (31)

1. Abadi M (2000) Security protocols and their properties. In: Bauer FL, Steinbrueggen R (eds) Foundations of secure computation, 20th Int. Summer School, Marktoberdorf, Germany, pp 39-60. IOS Press, Amsterdam
2. Abramsky S (1997) Semantics of interaction: an introduction to game semantics. In: Dybjer P, Pitts A (eds) Proceedings of the 1996 CLiCS Summer School, Isaac Newton Institute. Cambridge University Press, Cambridge
3. Abadi M, Cortier V (2005) Deciding knowledge in security protocols under (many more) equational theories. In: Proceedings of the 18th IEEE Computer Security Foundations Workshop
4. Adi K, Debbabi M, Mejri M (2003) A new logic for electronic commerce protocols. Theor Comput Sci 291(3):223-283
5. Abadi M, Fournet C (2001) Mobile values, new names, and secure communication. In: POPL, pp 104-115
6. Abadi M, Gordon A (1997) A calculus for cryptographic protocols: the SPI calculus. In: Proceedings of the 4th ACMconference on computer and communications security
7. Alur R, Henzinger T, Kupferman O (2002) Alternating-time temporal logic. JACM: J ACM, 49
8. Abramsky S, Malacaria P, Jagadeesan R (1994) Full abstraction for PCF. In: Theoretical Aspects of Computer Software, pp 1-15
9. Abadi M, Rogaway P (2002) Reconciling two views of cryptography (The computational soundeness of formal encryption). J Cryptol 15(2):103-127
10. Blanchet B, Abadi M, Fournet C (2005) Automated verification of selected equivalences for security protocols. In: LICS, pp 331-340. IEEE Computer Society, New York
11. Burrows M, Abadi M, Needham R (1989) A logic of authentication. Technical report, Digital Systems Research Center
12. Boreale M, Buscemi M (2005) A method for symbolic analysis of security protocols. TCS: Theoretical Computer Science, vol 338
13. Blass A (1992) A game semantics for linear logic. Ann Pure Appl Logic 56:183-220
14. Cervesato I, Durgin N, Lincoln P, Mitchell J, Scedrov A (1999) A meta-notation for protocol analysis. In: CSFW: Proceedings of The 12th Computer Security Foundations Workshop. IEEE Computer Society Press, New York
15. Clarke E, Jha S, MarreroW (1998) Using state space exploration and a natural deduction style message derivation engine to verify security protocols. In: International Conference on Programming Concepts and Methods, pp 87-106
16. Chadha R, kremer S, Scedrov A (2006) Formal analysis of multiparty contract signing. J Autom Reason 36:39-83
17. Cleaveland R (1990) Tableau-based model checking in the propositional mu-calculus. Acta Inform 27(8):725-748
18. Delaune S (2006) Verification des protocoles cryptographiques et proprietes algebriques. These de doctorat, Laboratoire Specification et Verification, ENS Cachan, France
19. Dolev D, Yao A (1983) On the security of public key protocols. IEEE Trans Inform Theory 29(2):198-208
20. Hyland JME, Ong C-HL (2000) On full abstraction for PCF: I, II, III. Info Comp 163:285-408
21. Jurjens J (2002) Games in the semantics of programming languages. Synthese (Elsevier) 133(1-2), October/November 2002
22. Kremer S, Raskin J (2000) A game approach to the verification of exchange protocols-application to non-repudiation protocols. In: Proceedings of the workshop on issues in the theory of security (WITS '00), 2000
23. Lorenz K (2001) Basic objectives of dialogue logic in historical perspective. Synthese (Elsevier), 127(1-2), April/May
24. Lowe G (1996) Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Software-concepts and tools 17(3):93-102
25. Lowe G (1997) A hierarchy of authentication specification. In: CSFW, pp 31-44. IEEE Computer Society, New York
26. Needham R, SchroederM(1978) Using encryption for authentication in large networks of computers. Commun ACM21(12)
27. Paulson LC (1998) The inductive approach to verifying cryptographic protocols. J Comp Secur 85-128 (1998)
28. Rivest RL, Shamir A, Adleman L (1978) Mental poker. Technical report TM-125, MIT, Nov
29. Schneier B (2001) Applied cryptography, 2nd edn. Wiley, New York
30. Tucker JV, Zucker JI (2000) Computable functions and semicomputable sets on many-sorted algebras. In: Abramsky S,Gabbay D, Maibaum T, (eds) Handbook of logic in computer science, vol 5, pp 317-523. Oxford University Press, Oxford
31. Woo TYC, Lam SS (1994) A lesson on authentication protocol design. Oper Syst Rev 24-37