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

  • Steve Kremer
  • Jean-François Raskin
Conference paper

DOI: 10.1007/3-540-44685-0_37

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2154)
Cite this paper as:
Kremer S., Raskin JF. (2001) A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. In: Larsen K.G., Nielsen M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg

Abstract

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 supports the alternating transition systems and the alternating temporal logic. Several optimistic protocols are analyzed using Mocha.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Steve Kremer
    • 1
  • Jean-François Raskin
    • 1
  1. 1.Département d’Informatique - Faculté des SciencesUniversité Libre de BruxellesBelgium

Personalised recommendations