Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
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
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The AVISS Security Protocol Analysis Tool
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
An NP Decision Procedure for Protocol Insecurity with XOR
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A Tool for Lazy Verification of Security Protocols
Proceedings of the 16th IEEE international conference on Automated software engineering
Deciding properties of contract-signing protocols
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
An intruder model for verifying liveness in security protocols
Proceedings of the fourth ACM workshop on Formal methods in security
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Deciding strategy properties of contract-signing protocols
ACM Transactions on Computational Logic (TOCL)
Nuovo DRM paradiso: towards a verified fair DRM scheme
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Using deductive knowledge to improve cryptographic protocol verification
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
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
| Hi-index | 0.00 |
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.