A game-theoretic framework for specification and verification of cryptographic protocols
From MaRDI portal
Publication:607405
Recommendations
Cites work
- scientific article; zbMATH DE number 1241697 (Why is no real title available?)
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 1479606 (Why is no real title available?)
- A calculus for cryptographic protocols: The spi calculus
- A game semantics for linear logic
- A logic of authentication
- A method for symbolic analysis of security protocols
- A new logic for electronic commerce protocols
- Alternating-time temporal logic
- Automated verification of selected equivalences for security protocols
- Basic objectives of dialogue logic in historical perspective
- Deciding knowledge in security protocols under equational theories
- Formal analysis of multiparty contract signing
- Mobile values, new names, and secure communication
- On full abstraction for PCF: I, II and III
- On the security of public key protocols
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Security protocols and their properties
- Tableau-based model checking in the propositional mu-calculus
- Using encryption for authentication in large networks of computers
Cited in
(6)- The layered games framework for specifications and analysis of security protocols
- A Calculus for Game-Based Security Proofs
- The Layered Games Framework for Specifications and Analysis of Security Protocols
- Automated Game-Theoretic Verification of Security Systems
- Game-Theoretic Analysis of an Incentivized Verifiable Computation System
- A Note on Game Theory and Verification
This page was built for publication: A game-theoretic framework for specification and verification of cryptographic protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607405)