Paper Info
Title
Constraint Solving for Contract-Signing Protocols
Abstract
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 shown that certain game-theoretic security properties, such as balance for contract-signing protocols, are decidable in a Dolev-Yao style model with a bounded number of sessions but unbounded message size. However, this result does not provide a practical algorithm as it merely bounds the size of attacks. In this paper, we prove that game-theoretic security properties can be decided based on standard constraint solving procedures. In the past, these procedures have successfully been employed in implementations and tools for reachability properties. Our results thus pave the way for extending these tools and implementations to deal with game-theoretic security properties.
Year
DOI
Venue
2005
10.1007/11539452_20
International Conference on Concurrency Theory
Keywords
Field
DocType
game-theoretic security property,bounded number,certain game-theoretic security property,dolev-yao style model,practical algorithm,contract-signing protocol,cryptographic protocol,unbounded message size,reachability property,automatic analysis
Constraint satisfaction,Authentication,Cryptographic protocol,Cryptography,Concurrency,Computer science,Secrecy,Theoretical computer science,Constraint satisfaction problem,Reachability,Distributed computing
Conference
Volume
ISSN
ISBN
3653
0302-9743
3-540-28309-9
Citations 
PageRank 
References 
10
0.55
13
Authors
2
Name
Order
Citations
PageRank
Detlef Kähler1583.17
Ralf Küsters2101469.62