Some cryptographic tasks, such as contract signing and other related tasks, need to ensure complex, branching time security properties. When defining such properties one needs to deal with subtle problems regarding the scheduling of non-deterministic decisions, the delivery of messages sent on resilient (non-adversarially controlled) channels, fair executions (executions where no party, both honest and dishonest, is unreasonably precluded to perform its actions), and defining strategies of adversaries against all possible non-deterministic choices of parties and arbitrary delivery of messages via resilient channels. These problems are typically not addressed in cryptographic models and these models therefore do not suffice to formalize branching time properties, such as those required of contract signing protocols. In this paper, we develop a cryptographic model that deals with all of the above problems. One central feature of our model is a general definition of fair scheduling which not only formalizes fair scheduling of resilient channels but also fair scheduling of actions of honest and dishonest principals. Based on this model and the notion of fair scheduling, we provide a definition of a prominent branching time property of contract signing protocols, namely balance, and give the first cryptographic proof that the Asokan-Shoup-Waidner two-party contract signing protocol is balanced.
|Translated title of the contribution||A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols|
|Title of host publication||European Symposium On Research In Computer Security - ESORICS 2007|
|Publisher||Springer Berlin Heidelberg|
|Publication status||Published - 2007|
Bibliographical noteOther page information: 422-437
Conference Proceedings/Title of Journal: 12th European Symposium On Research In Computer Security -- ESORICS'07
Other identifier: 2000756