A Game-Based Verification of Non-repudiation and Fair Exchange Protocols [chapter]

Steve Kremer, Jean-François Raskin
2001 Lecture Notes in Computer Science  
In this paper, we report on a recent work for the verification of non-repudiation protocols. We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. To formalize this idea, we use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. This method is automated by using the model-checker Mocha, a model-checker that
more » ... the alternating transition systems and the alternating temporal logic. Several optimistic protocols are analyzed using Mocha.
doi:10.1007/3-540-44685-0_37 fatcat:5h6xtmxuxvgknadcnsgglfg3uq