Abstract
Fair exchange protocols are a mechanism to ensure that items held by two parties are exchanged without one party gaining an advantage. Several such protocols have been proposed in recent years. We used the Possum animation tool to explore these protocols to examine whether they achieve their security goals. Our experiments revealed some new attacks and helped to gain other useful insights into various fair exchange protocols.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Asokan, Victor Shoup and Michael Waidner, “Asynchronous Protocols for Optimistic Fair Exchange”, IEEE Symposium on Security and Privacy, 1998, IEEE Computer Society Press, 1998. Corrected version available at http://www.zurich.ibm.com/Technology/Security/publications/1998/ASW98.ps.gz.
Holger Bürk and Andreas Pfitzmann, “Value Exchange Systems Enabling Security and Observability”, Computers and Security, 9, 8, pp.715–721, 1991.
Josep Lluís Gomila, Llorenç Huguet i Rotger, “An Efficient Asynchronous Protocol for Optimistic Certified Electronic Mail”, CRYPTEC’99 Proceedings, City University of Hong Kong Press, 1999, pp.147–154.
Dan Hazel, Paul Strooper and Owen Traynor, “Possum: An animator for the Sum specification language”, Asia-Pacific Software Engineering Conference and International Computer Science Conference, IEEE Computer Society, 1997, pp.42–51.
Catherine Meadows,“Open Issues in Formal Methods for Cryptogra-phic Protocol Analysis”, Proceedings of DISCEX 2000, IEEE Computer Society Press, pp. 237–250, January, 2000. Also available at http://chacs.nrl.navy.mil/publications/CHACS/2000/2000meadowsdiscex.ps.
B. Potter, J. Sinclair and D. Till, An Introduction to Formal Specification and Z, Prentice Hall, 1991.
S. Schneider, Formal Analysis of a Non-Repudiation Protocol, 11th IEEE Computer Security Foundations Workshop, 1998. Also available at http://www.dcs.rhbnc.ac.uk/research/formal/steve/papers/csfw98.ps.gz.
Owen Traynor, Peter Kearney, Ed Kazmierczak, Li Wang and Einar Karlsen, “Extending Z with Modules”, Australasian Computer Science Communications, 17, 1, pp.513–522, 1995.
J. Zhou and D. Gollman, “A Fair Non-Repudiation Protocol”, IEEE Symposium on Security and Privacy, pp.56–61, IEEE Computer Society Press, 1996.
J. Zhou and D. Gollman, “An Efficient Non-Repudiation Protocol”, IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, pp.126–132, 1997
J. Zhou and D. Gollmann, “Towards Verification of Non-repudiation Protocols”, Proceedings of 1998 International Refinement Workshop and Formal Methods Pacific, pp. 370–380, Canberra, Australia, September 1998, Springer. Also available at http://homex.s-one.net.sg/user/jyzhou/IRW98.ps.
Jianying Zhou, Robert Deng and Feng Bao, “Some Remarks on a Fair Exchange Protocol”, Public Key Cryptography 2000, Springer-Verlag, 2000, pp.46–57.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyd, C., Kearney, P. (2000). Exploring Fair Exchange Protocols Using Specification Animation. In: Goos, G., Hartmanis, J., van Leeuwen, J., Pieprzyk, J., Seberry, J., Okamoto, E. (eds) Information Security. ISW 2000. Lecture Notes in Computer Science, vol 1975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44456-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-44456-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41416-2
Online ISBN: 978-3-540-44456-5
eBook Packages: Springer Book Archive