An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Inductive methods and contract-signing protocols
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Finite-state analysis of two contract signing protocols
Theoretical Computer Science
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Analyzing the Needham-Schroeder Public-Key Protocol: A Comparison of Two Approaches
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Analysis of Abuse-Free Contract Signing
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Exploring Fair Exchange Protocols Using Specification Animation
ISW '00 Proceedings of the Third International Workshop on Information Security
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
An Efficient Non-repudiation Protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Formal Analysis of a Non-Repudiation Protocol
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Security Protocol Design via Authentication Tests
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Constraint solving for contract-signing protocols
CONCUR 2005 - Concurrency Theory
Computer-assisted verification of a protocol for certified email
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Compositional analysis of contract-signing protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Analysis of probabilistic contract signing
Journal of Computer Security
Authentication tests and disjoint encryption: A design method for security protocols
Journal of Computer Security - Special issue on CSFW15
The ASW Protocol Revisited: A Unified View
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal analysis and improvement of multi-party non-repudiation protocol
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Deciding strategy properties of contract-signing protocols
ACM Transactions on Computational Logic (TOCL)
Computer-assisted verification of a protocol for certified email
SAS'03 Proceedings of the 10th international conference on Static analysis
Computationally sound analysis of a probabilistic contract signing protocol
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Multi-Attacker Protocol Validation
Journal of Automated Reasoning
A dolev-yao-based definition of abuse-free protocols
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Game semantics model for security protocols
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Proving ATL* properties of infinite-state systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Deciding properties of contract-signing protocols
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Fairness electronic payment protocol
International Journal of Grid and Utility Computing
Synthesizing protocols for digital contract signing
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
A rational approach to cryptographic protocols
Mathematical and Computer Modelling: An International Journal
Game-based verification of contract signing protocols with minimal messages
Innovations in Systems and Software Engineering
A cryptographic model for branching time security properties: the case of contract signing protocols
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
In this paper we report on the verification of two contract signing protocols. Our verification method is based on the idea of modeling those protocols as games, and reasoning about their properties as strategies for players. We use the formal model of alternating transition systems to represent the protocols and alternating-time temporal logic to specify properties.The paper focuses on the verification of abuse-freeness, relates this property to the balance property, previously studied using two other formalisms, shows some ambugities in the definition of abuse-freeness and proposes a new, stronger definition. Formal methods are not only usefulhere to verify automatically the protocols but also to better understand their requirements (balance and abuse-freeness are quite complicated and subtle properties).