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

DOI10.1007/S00165-009-0129-4zbMath1211.68254OpenAlexW2012369158MaRDI QIDQ607405

Mohamed Saleh, Mourad Debbabi

Publication date: 22 November 2010

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-009-0129-4

zbMATH Keywords

formal verificationmodel checkinggame semanticssecurity protocols

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for symbolic analysis of security protocols
• Deciding knowledge in security protocols under equational theories
• Formal analysis of multiparty contract signing
• Tableau-based model checking in the propositional mu-calculus
• A game semantics for linear logic
• A calculus for cryptographic protocols: The spi calculus
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• A new logic for electronic commerce protocols
• On full abstraction for PCF: I, II and III
• Automated verification of selected equivalences for security protocols
• Alternating-time temporal logic
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• A logic of authentication
• Mobile values, new names, and secure communication
• Basic objectives of dialogue logic in historical perspective

This page was built for publication: A game-theoretic framework for specification and verification of cryptographic protocols