Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Inductive methods and contract-signing protocols
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Alternating-time temporal logic
Journal of the ACM (JACM)
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Compositional analysis of contract-signing protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Infinite State AMC-Model Checking for Cryptographic Protocols
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm
FSKD '07 Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02
Computationally sound symbolic secrecy in the presence of hash functions
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Deciding properties of contract-signing protocols
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
A cryptographic model for branching time security properties: the case of contract signing protocols
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
ACM Transactions on Computational Logic (TOCL)
Automatic verification of competitive stochastic systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
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.