Game-Based Verification of Multi-Party Contract Signing Protocols

Ying Zhang,Chenyi Zhang,Sjouke Mauw,Jun Pang

doi:10.1007/978-3-642-12459-4_14

Ying Zhang, Chenyi Zhang + Show 2 more

Open Access

https://doi.org/10.1007/978-3-642-12459-4_14

Copy DOI

Publication Date: Jan 1, 2010
Citations: 24	License type: cc-by-nc-sa

Affiliation: University of Luxembourg, Shandong University

Abstract

AbstractA 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.KeywordsModel CheckComputation Tree LogicHonest SignerContract SigningModel Check ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Full Text