Computationally Sound Analysis of a Probabilistic Contract Signing Protocol

to full text (361 kB)   ZIP
involved person(s) / institution(s)author :
datePublished :
  • April 2009
size33 S.

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.
Static URLhttps://www.uni-kiel.de/journals/receive/jportal_jparticle_00000094
 
URN:NBNurn:nbn:de:101:1-201203133476
IDNumber of report :
  • TR_0911