A game-based verification of non-repudiation and fair exchange protocols

Journal of Computer Security

Volumn 11, Issue 3, 2003, Pages 399-429

  Kremer, Steve ^a   Raskin, Jean François ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; COMPUTER SOFTWARE; DATA COMMUNICATION SYSTEMS; FORMAL LOGIC; SECURITY OF DATA; SEMANTICS;

ALTERNATING TEMPORAL LOGIC; ALTERNATING TRANSITION SYSTEMS; GAME BASED MODEL; GAME-BASED VERIFICATION; NON-REPUDIATION PROTOCOLS;

NETWORK PROTOCOLS;

EID: 0037937457     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2003-11307     Document Type: Article

References (30)

1. R. Alur, T. Henzinger and O. Kupferman, Alternating-time temporal logic, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1997, pp. 100-109.
2. R. Alur, T. Henzinger, F. Mang, S. Qadeer, S. Rajamani and S. Tasiran, MOCHA: modularity in model checking, in: CAV 98: Computer-aided Verification, A. Hu and M. Vardi, eds, Lecture Notes in Computer Science 1427, Springer-Verlag, 1998, pp. 521-525.
3. N. Asokan, M. Schunter and M. Waidner, Optimistic protocols for fair exchange, in: 4th ACM Conference on Computer and Communications Security, T. Matsumoto, ed., Zurich, Switzerland, ACM Press 1997, pp. 6, 8-17.
4. N. Asokan, V. Shoup and M. Waidner, Asynchronous protocols for optimistic fair exchange, in: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, CA, IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press, 1998, pp. 86-99.
5. N. Asokan, V. Shoup and M. Waidner, Optimistic fair exchange of digital signatures, in: Advances in Cryptology - EUROCRYPT'98, Volume 1403 of Lecture Notes in Computer Science, 1998, pp. 591-606.
6. M. Ben-Or, O. Goldreich, S. Micali and R.L. Rivest, A fair protocol for signing contracts. IEEE Transactions on Information Theory 36(1) (1990), 40-46.
7. D. Boneh and M. Naor, Timed commitments, in: Advances in Cryptology: Proceedings of Crypto 2000, Volume 1880 of Lecture Notes in Computer Science, M. Bellare, ed., Springer-Verlag. 2000, pp. 236-254.
8. C. Boyd and P. Kearney, Exploring fair exchange protocols using specification animation. in: The Third International Workshop on Information Security - ISW2000, Lecture Notes in Computer Science, Australia, Springer-Verlag, 2000.
9. M. Burrows, M. Abadi and R. Needham, A logic of authentication, from proceedings of the royal society, Volume 426, number 1871, 1989, in: William Stallings, Practical Cryptography for Data Internetworks, IEEE Computer Society Press, 1996, 1996.
10. G. Chiou and W. Chen, Secure broadcasting using the secure lock, IEEE Transactions on Software Engineering 15(8) (1989), 929-934.
11. S. Even and Y. Yacobi, Relations among public key signature systems, Technical Report 175, Technion, Haifa, Israel, Mar. 1980.
12. T. Henzinger, R. Manjumdar, F. Mang and J.-F. Raskin, Abstract interpretation of game properties, in: SAS 2000: International Symposium on Static Analysis, Lecture Notes in Computer Science, Springer-Verlag, 2000.
13. S. Kremer and O. Markowitch, Optimistic non-repudiable information exchange, in: 21th Symp. on Information Theory in the Benelux, J. Biemond, ed., Werkgemeenschap Informatie- en Communicatietheorie, Enschede, 2000, pp. 139-146.
14. S. Kremer and J.-F. Raskin, A game-based verification of non-repudiation and fair exchange protocols, in: CONCUR: 12th International Conference on Concurrency Theory, Volume 2154 of Lecture Notes in Computer Science, K. Larsen and M. Nielsen, eds, Aalborg, Denmark, Springer-Verlag, 2001.
15. G. Lowe, An attack on the Needham-Schroeder public-key authentication protocol, Information Processing Letters 56(3) (1995), 131-133.
16. G. Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using FDR. in: Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Volume 1055 of Lecture Notes in Computer Science, Springer-Verlag, 1996, pp. 147-166.
17. O. Markowitch and S. Kremer, A multi-party optimistic non-repudiation protocol, in: Proceedings of The 3rd International Conference on Information Security and Cryptology (ICISC 2000), Volume 2015 of Lecture Notes in Computer Science, D. Won, ed., Seoul, Korea, Springer-Verlag, 2000.
18. O. Markowitch and Y. Roggeman, Probabilistic non-repudiation without trusted third party, in: Second Conference on Security in Communication Networks '99, Amalfi, Italy, 1999.
19. C.A. Meadows, Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches, Lecture Notes in Computer Science 1146 (1996), 351-365.
20. S. Micali, Certified E-mail with invisible post offices. Available from author; an invited presentation at the RSA '97 Conference, 1997.
21. L.C. Paulson, Proving properties of security protocols by induction, in: Proceedings of the 10th Computer Security Foundations Workshop, IEEE Computer Society Press, 1997, pp. 70-83.
22. S. Schneider, Formal analysis of a non-repudiation protocol, in: Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW '98), Washington - Brussels - Tokyo, IEEE, 1998, pp. 54-65.
23. V. Shmatikov and J. Mitchell, Analysis of a fair exchange protocol, in: Symposium on Network and Distributed Systems Security (NDSS '00), San Diego, CA, Internet Society, 2000, pp. 119-128.
24. V. Shmatikov and J. Mitchell, Analysis of abuse-free contract signing, in: Financial Cryptography '00, Volume 1962 of Lecture Notes in Computer Science, Anguilla, Springer-Verlag, 2000.
25. V. Shmatikov and J. Mitchell, Finite-state analysis of two contract signing protocols, Special issue of Theoretical Computer Science on security, 2001 (accepted for publication).
26. T. Tedrick, How to exchange half a bit, in: Advances in Cryptology: Proceedings of Crypto 83, 1983, D. Chaum, ed., Plenum Press, New York and London, 1984, pp, 147-151.
27. T. Tedrick, Fair exchange of secrets, in: Advances in Cryptology: Proceedings of Crypto 84, Volume 196 of Lecture Notes in Computer Science, G.R. Blakley and D.C. Chaum, eds, Springer-Verlag, 1985, pp. 434-438.
28. J. Zhou, R. Deng and F. Bao, Some remarks on a fair exchange protocol, in: 2000 International Workshop on Practice and Theory in Public Key Cryptography, Lecture Notes in Computer Science, Melbourne, Australia, Springer-Verlag, 2000.
29. J. Zhou and D. Gollmann, Towards verification of non-repudiation protocols, in: Proceedings of 1998 International Refinement Workshop and Formal Methods Pacific, Canberra, Australia, Springer-Verlag, 1998, pp. 370-380.
30. Y. Zhou and D. Gollmann, An efficient non-repudiation protocol, in: Proceedings of The 10th Computer Security Foundations Workshop, IEEE Computer Society Press, 1997, pp. 126-132.