Formal Analysis of Multiparty Contract Signing

Authors:
Rohit Chadha;Steve Kremer;Andre Scedrov
Affiliations:
University of Sussex, Sussex, UK;Laboratoire Spécification et Vérification, CNRS, UMR 8643, INRIA Futurs Projet SECSI & ÉÉcole Normale Supérieure de Cachan, Cachan Cedex, France 94235;University of Pennsylvania, Philadelphia, USA
Venue:
Journal of Automated Reasoning
Year:
2006

Citing 0
Cited 11

Epistemic Logic for the Applied Pi Calculus

FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Multiparty Contract Signing Over a Reliable Network

Electronic Notes in Theoretical Computer Science (ENTCS)
Finite models for formal security proofs

Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Verification of A Key Chain Based TTP Transparent CEM Protocol

Electronic Notes in Theoretical Computer Science (ENTCS)
Proving ATL* properties of infinite-state systems

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Game-based verification of multi-party contract signing protocols

FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Fairness electronic payment protocol

International Journal of Grid and Utility Computing
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
Alternating-Time temporal logic in the calculus of (co)inductive constructions

SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Design and formal verification of a CEM protocol with transparent TTP

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the multiparty contract-signing protocols of Garay and MacKenzie (GM) and of Baum and Waidner (BW). We use a finite-state tool, Mocha, which allows specification of protocol properties in a branching-time temporal logic with game semantics. While our analysis does not reveal any errors in the BW protocol, in the GM protocol we discover serious problems with fairness for four signers and an oversight regarding abuse-freeness for three signers. We propose a complete revision of the GM subprotocols in order to restore fairness.