Sciweavers

73 search results - page 1 / 15
» Deciding Properties of Contract-Signing Protocols
Sort
View
STACS
2005
Springer
13 years 10 months ago
Deciding Properties of Contract-Signing Protocols
Abstract. We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. ...
Detlef Kähler, Ralf Küsters, Thomas Wilk...
CONCUR
2005
Springer
13 years 10 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters
WKDD
2010
CPS
217views Data Mining» more  WKDD 2010»
13 years 11 months ago
Two-round Multi-Party Contract Signing
—A multi-party contract signing (MPCS) protocol allows a set of parties to exchange messages with each other to reach a state in which either each of them has a pre-agreed contra...
Xiangdong Li, Qiusheng Zheng
CSFW
2005
IEEE
13 years 10 months ago
Compositional Analysis of Contract Signing Protocols
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...
CSFW
2004
IEEE
13 years 8 months ago
Formal Analysis of Multi-Party Contract Signing
We analyze the multi-party contract-signing protocols of Garay and MacKenzie (GM) and of Baum and Waidner (BW). We use a finite-state tool, MOCHA, which allows specification of pr...
Rohit Chadha, Steve Kremer, Andre Scedrov