Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

STACS
2005
Springer

favoriteEmaildiscussreport

69views Theoretical Computer Science» more STACS 2005»

Deciding Properties of Contract-Signing Protocols

14 years 4 months ago

Deciding Properties of Contract-Signing Protocols

Download people.inf.ethz.ch

Abstract. We show that for inﬁnite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. As a consequence, we obtain that crucial properties of contract-signing protocols such as balance are decidable.

Detlef Kähler, Ralf Küsters, Thomas Wilk

Real-time Traffic

Cryptographic Protocols | Fundamental Branching Properties | Inﬁnite Transition Systems | STACS 2005 | Theoretical Computer Science |

claim paper

Related Content

» Constraint Solving for ContractSigning Protocols

» Tworound MultiParty Contract Signing

» Compositional Analysis of Contract Signing Protocols

» Formal Analysis of MultiParty Contract Signing

» Computationally Sound Analysis of a Probabilistic Contract Signing Protocol

» Contract Signing Optimism and Advantage

» An abusefree fair contract signing protocol based on the RSA signature

» Analysis of probabilistic contract signing

» An abusefree fair contractsigning protocol based on the RSA signature

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Detlef Kähler, Ralf Küsters, Thomas Wilke

Comments (0)