par Chadha, Rohit;Kremer, Steve ;Scedrov, Andre
Référence Proceedings - Computer Security Foundations Workshop, 17, page (266-279)
Publication Publié, 2004
Article révisé par les pairs
Résumé : We analyze the multi-party 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-tune 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.