Deciding properties of contract-signing protocols

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 158-169

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

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTRACTS; CRYPTOGRAPHY;

CONTRACT-SIGNING PROTOCOLS; DECIDING PROPERTIES; TRANSITION SYSTEMS;

NETWORK PROTOCOLS;

EID: 24144437134     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_13     Document Type: Conference Paper

References (17)

1. R.M. Amadio, D. Lugiez, and V. Vanackere. On the symbolic reduction of processes with cryptographic functions. TCS, 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, volume 2404 of LNCS, pages 349-353. Springer, 2002.
3. N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proc. of the IEEE Symposium on Research in Security and Privacy, pages 86-99, 1998.
4. M. Ben-Or, O. Goldreich, S. Micali, and R.L. Rivest. A fair protocol for signing contracts. IEEE Transactions on Information Theory, 36(1):40-46, 1990.
5. M. Boreale. Symbolic trace analysis of cryptographic protocols. In ICALP 2001, volume 2076 of Lecture Notes in Computer Science, pages 667-681. Springer-Verlag, 2001.
6. R. Chadha, M.I. Kanovich, and A.Scedrov. Inductive methods and contract-signing protocols. In CCS 2001, pages 176-185. ACM Press, 2001.
7. R. Chadha, S. Kremer, and A. Scedrov. Formal analysis of multi-party contract signing. In CSFW-17, pages 266-279. IEEE Computer Society Press, 2004.
8. H. Comon and V. Shmatikov. Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technolog, 2002.
9. P. H. Drielsma and S. Mödersheim. The ASW protocol revisited: A unified view. In Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA), 2004.
10. J.A. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free optimistic contract signing. In CRYPTO'99, volume 1666 of LNCS, pages 449-466. Springer-Verlag, 1999.
11. D. Kähler, R. Küster, T. Wilke. Deciding Properties of Contract-Signing Protocols. Technical Report IFI 0409, CAU Kiel, 2004. Available from http://www.informatik.uni-kiel.de/reports/2004/0409.html
12. S. Kremer and J.-F. Raskin. Game analysis of abuse-free contract signing. In Computer Security Foundations Workshop 2002 (CSFW 2002). IEEE Computer Society, 2002.
13. C. Meadows. Formal Methods for Cryptographic Protocol Analysis: Emerging Issues and Trends. IEEE Journal on Selected Areas in Communication, 21(1):44-54, January 2003.
14. J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In CCS 2001, pages 166-175. ACM Press, 2001.
15. 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.
16. V. Shmatikov and J.C. Mitchell. Finite-state analysis of two contract signing protocols. Theoretical Computer Science, 283(2) :419-450, 2002.
17. J. Zhou and D. Gollmann. A fair non-repudiation protocol. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 55-61. IEEE Computer Society Press, 1996.