Constraint solving for contract-signing protocols

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 233-247

  Kähler, Detlef ^a   Küsters, Ralf ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GAME THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA;

CONTRACT-SIGNING PROTOCOLS; CRYPTOGRAPHIC PROTOCOLS; DOLEV-YAO STYLE MODEL; GAME-THEORETIC SECURITY PROPERTIES;

CRYPTOGRAPHY;

EID: 27244431635     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_20     Document Type: Conference Paper

References (15)

1. R.M. Amadio, D. Lugiez, and V. Vanackere. On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science, 290(1):695-740, 2002.
2. A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna, S. Mödersheim, M. Rusinowitch, M. Turuani, L. Viganò, and L. Vigneron. The AVISS Security Protocol Analysis Tool. In CAV 2002, LNCS 2404, pages 349-353. Springer, 2002.
3. N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Security&Privacy 2002, pages 86-99, 1998.
4. D. Basin, S. Mödersheim, and L. Viganò. An On-The-Fly Model-Checker for Security Protocol Analysis. In ESORICS 2003, LNCS 2808, pages 253-270. Springer, 2003.
5. R. Chadha, M.I. Kanovich, and A.Scedrov. Inductive methods and contract-signing protocols. In CCS 2001, pages 176-185. ACM Press, 2001.
6. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP Decision Procedure for Protocol Insecurity with XOR. In LICS 2003, pages 261-270. IEEE, Computer Society Press, 2003.
7. Y. Chevalier and L. Vigneron. A Tool for Lazy Verification of Security Protocols. In ASE 2001, pages 373-376. IEEE CS Press, 2001.
8. P. H. Drielsma and S. Mödersheim. The ASW Protocol Revisited: A Unified View. In ARSPA, 2004.
9. J.A. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free optimistic contract signing. In CRYPTO'99, LNCS 1666, pages 449-466. Springer-Verlag, 1999.
10. D. Kähler and R. Küsters. A Constraint-Based Algorithm for Contract-Signing Protocols. Technical report, IFI 0503, CAU Kiel, Germany, 2005. Available from http://www.informatik.uni-kiel.de/reports/2005/0503.html
11. D. Kähler, R. Küsters, and Th. Wilke. Deciding Properties of Contract-Signing Protocols. In STACS 2005, LNCS 3404, pages 158-169. Springer, 2005.
12. S. Kremer and J.-F. Raskin. Game analysis of abuse-free contract signing. In CSFW 2002, pages 206-220. IEEE Computer Society, 2002.
13. J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In CCS 2001, pages 166-175. ACM Press, 2001.
14. M. Rusinowitch and M. Turuani. Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theoretical Computer Science, 299(1-3):451-475, 2003.
15. V. Shmatikov and J.C. Mitchell. Finite-state analysis of two contract signing protocols. Theoretical Computer Science, 283(2):419-450, 2002.