Inductive methods and contract-signing protocols
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Finite-state analysis of two contract signing protocols
Theoretical Computer Science
Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Computational Probabilistic Non-interference
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Polynomial Fairness and Liveness
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Compositional Analysis of Contract Signing Protocols
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Polynomial Runtime in Simulatability Definitions
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Constraint solving for contract-signing protocols
CONCUR 2005 - Concurrency Theory
On fairness in simulatability-based cryptographic systems
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Simulation-Based Security with Inexhaustible Interactive Turing Machines
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
A dolev-yao-based definition of abuse-free protocols
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On the relationships between notions of simulation-based security
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Deciding properties of contract-signing protocols
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Optimistic fair exchange of digital signatures
IEEE Journal on Selected Areas in Communications
Computationally sound analysis of a probabilistic contract signing protocol
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Complexity of fairness constraints for the Dolev-Yao attacker model
Proceedings of the 2011 ACM Symposium on Applied Computing
Game-based verification of multi-party contract signing protocols
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Game-based verification of contract signing protocols with minimal messages
Innovations in Systems and Software Engineering
Hi-index | 0.00 |
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.