Handbook of theoretical computer science (vol. B)
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Alternating-time temporal logic
Journal of the ACM (JACM)
Abuse-Free Multi-party Contract Signing
Proceedings of the 13th International Symposium on Distributed Computing
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Formal Analysis of Multiparty Contract Signing
Journal of Automated Reasoning
Fair multi-party contract signing using private contract signatures
Information and Computation
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
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
An intensive survey of fair non-repudiation protocols
Computer Communications
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
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
Verification of A Key Chain Based TTP Transparent CEM Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Game-based verification of contract signing protocols with minimal messages
Innovations in Systems and Software Engineering
Fairness in non-repudiation protocols
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Design and formal verification of a CEM protocol with transparent TTP
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
A multi-party contract signing (MPCS) protocol is used for a group of signers to sign a digital contract over a network. We analyse the protocols of Mukhamedov and Ryan (MR), and of Mauw, Radomirović and Torabi Dashti (MRT), using the finite-state model checker Mocha. Mocha allows for the specification of properties in alternating-time temporal logic (ATL) with game semantics, and the model checking problem for ATL requires the computation of winning strategies. This gives us an intuitive interpretation of the verification problem of crucial properties of MPCS protocols. We analyse the MR protocol with up to 5 signers and our analysis does not reveal any flaws. MRT protocols can be generated from minimal message sequences, depending on the number of signers. We discover an attack in a published MRT protocol with 3 signers, and present a solution for it. We also design a number of MRT protocols using minimal message sequences for 3 and 4 signers, all of which have been model checked in Mocha.