Abstract
In this paper, we report on a recent work for the verification of non-repudiation protocols. We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. To formalize this idea, we use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. This method is automated by using the model-checker Mocha, a model-checker that supports the alternating transition systems and the alternating temporal logic. Several optimistic protocols are analyzed using Mocha.
This author was partially supported by a “Crédit aux chercheurs” granted by the Belgian National Fund for Scientific Research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 100–109. IEEE Computer Society Press, 1997.
N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In T. Matsumoto, editor, 4th ACM Conference on Computer and Communications Security, pages 6, 8–17, Zurich, Switzerland, Apr. 1997. ACM Press.
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, pages 86–99, Oakland, CA, May 1998. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press.
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, Dec. 2000. Springer-Verlag.
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.
T. Henzinger, R. Manjumdar, F. Mang, and J.-F. Raskin. Abstract interpretation of game properties. In SAS 2000: Intertional Symposium on Static Analysis, Lecture Notes in Computer Science. Springer-Verlag, 2000.
S. Kremer and O. Markowitch. Optimistic non-repudiable information exchange. In J. Biemond, editor, 21th Symp. on Information Theory in the Benelux, pages 139–146. Werkgemeenschap Informatieen Communicatietheorie, Enschede, may 2000.
S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. Technical Report 451, ULB, 2001.
G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Lecture Notes in Computer Science, 1055:147–157, 1996.
O. Markowitch and S. Kremer. A multi-party optimistic non-repudiation protocol. In D. Won, editor, Proceedings of The 3rd International Conference on Information Security and Cryptology (ICISC 2000), volume 2015 of Lecture Notes in Computer Science, Seoul, Korea, 2000. Springer-Verlag.
C. A. Meadows. Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches. Lecture Notes in Computer Science, 1146:351–365, 1996.
L. C. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th Computer Security Foundations Workshop, pages 70–83. IEEE Computer Society Press, June 1997.
S. Schneider. Formal analysis of a non-repudiation protocol. In Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW’ 98), pages 54–65, Washington-Brussels-Tokyo, June 1998. IEEE.
V. Shmatikov and J. Mitchell. Analysis of abuse-free contract signing. In Financial Cryptography’ 00, Anguilla, 2000.
J. Zhou and D. Gollmann. Towards verification of non-repudiation protocols. In Proceedings of 1998 International Refinement Workshop and Formal Methods Pacific, pages 370–380, Canberra, Australia, Sept. 1998. Springer.
Y. Zhou and D. Gollmann. An efficient non-repudiation protocol. In PCSFW: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kremer, S., Raskin, JF. (2001). A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_37
Download citation
DOI: https://doi.org/10.1007/3-540-44685-0_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42497-0
Online ISBN: 978-3-540-44685-9
eBook Packages: Springer Book Archive