Computationally Sound Analysis of a Probabilistic Contract Signing Protocol

We propose a probabilistic contract signing protocol that achieves balance even in the presence of an adversary that may delay messages sent over secure channels. To show that this property holds in a computational setting, we first propose a probabilistic framework for protocol analysis, then prove that in a symbolic setting the protocol satisfies a probabilistic alternating-time temporal formula expressing balance, and finally establish a general result stating that the validity of formulas such as our balance formula is preserved when passing from the symbolic to a computational setting. The key idea of the protocol is to take a "gradual commitment" approach.

• Type: Conference
• Year: 2009
• Where: ESORICS
• Authors: Mihhail Aizatulin, Henning Schnoor, Thomas Wilke
• Keywords: Computational Setting, ESORICS 2009, Formula Expressing Balance, Probabilistic Contract Signing, Security Privacy