Skip to main content

Analysis of a Multi-party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space Model

  • Conference paper
Financial Cryptography and Data Security (FC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3570))

Included in the following conference series:

Abstract

A multi-party fair exchange protocol is a cryptographic protocol allowing several parties to exchange commodities in such a way that everyone gives an item away if and only if it receives an item in return. In this paper we discuss a multi-party fair exchange protocol originally proposed by Franklin and Tsudik, and subsequently shown to have flaws and fixed by González and Markowitch. We identify flaws in the fixed version of the protocol, propose a corrected version, and give a formal proof of correctness in the strand space model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asokan, N., Baum-Waidner, B., Schunter, M., Waidner, M.: Optimistic synchronous multi-party contract signing. Research Report RZ 3089, IBM Research Division (December 1998)

    Google Scholar 

  2. Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for multi-party fair exchange. Research Report RZ 2892 (# 90840), IBM Research (December 1996)

    Google Scholar 

  3. Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, April 1997. ACM Press, New York (1997)

    Google Scholar 

  4. Bao, F., Deng, R.H., Nguyen, K.Q., Varadharajan, V.: Multi-party fair exchange with an off-line trusted neutral party. In: DEXA 1999 Workshop on Electronic Commerce and Security, Florence, Italy, (September 1999)

    Google Scholar 

  5. Baum-Waidner, B.: Optimistic asynchronous multi-party contract signing with reduced number of rounds. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 898–911. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Baum-Waidner, B., Waidner, M.: Round-optimal and abuse free optimistic multi-party contract signing. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 524–535. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Bürk, H., Pfitzmann, A.: Value exchange systems enabling security and unobservability. Computers and Security 9(8), 715–721 (1990)

    Article  Google Scholar 

  8. Chadha, R., Kanovich, M., Scedrov, A.: Inductive methods and contract-signing protocols. In: 8th ACM Conference on Computer and Communications Security, Philadelphia, PA, USA, November 2001. ACM Press, New York (2001)

    Google Scholar 

  9. Chadha, R., Kremer, S., Scedrov, A.: Formal analysis of multi-party fair exchange protocols. In: Focardi, R. (ed.) 17th IEEE Computer Security Foundations Workshop, Asilomar, CA, USA, June 2004, pp. 266–279. IEEE Computer Society Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  10. Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198–208 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  11. Even, S., Yacobi, Y.: Relations among public key signature systems. Technical Report 175, Technion, Haifa, Israel (March 1980)

    Google Scholar 

  12. Franklin, M.K., Tsudik, G.: Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 90–102. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  13. Garay, J.A., MacKenzie, P.D.: Abuse-free multi-party contract signing. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 151–166. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. González-Deleito, N., Markowitch, O.: Exclusion-freeness in multi-party exchange protocols. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 200–209. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Kremer, S., Markowitch, O.: Fair multi-party non-repudiation. International Journal on Information Security 1(4), 223–235 (2003)

    Article  Google Scholar 

  16. Kremer, S., Raskin, J.-F.: A game-based verification of non-repudiation and fair exchange protocols. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 551–565. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Onieva, J., Zhou, J., Carbonell, M., Lopez, J.: A multi-party non-repudiation protocol for exchange of different messages. In: 18th IFIP International Information Security Conference, Athens, Greece, May 2003. Kluwer, Dordrecht (2003)

    Google Scholar 

  18. Pereira, O., Quisquater, J.-J.: Generic insecurity of cliques-type authenticated group key agreement protocols. In: Focardi, R. (ed.) 17th IEEE Computer Security Foundations Workshop, Asilomar, CA, USA, June 2004, pp. 16–29. IEEE Computer Society Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  19. Schneider, S.A.: Formal analysis of a non-repudiation protocol. In: 11th IEEE Computer Security Foundations Workshop, Washington, Brussels, Tokyo, June 1998, pp. 54–65. IEEE, Los Alamitos (1998)

    Google Scholar 

  20. Shmatikov, V., Mitchell, J.: Finite-state analysis of two contract signing protocols. Theoretical Computer Science, special issue on Theoretical Foundations of Security Analysis and Design 283(2), 419–450 (2002)

    MATH  MathSciNet  Google Scholar 

  21. Javier Thayer Fabrega, F., Herzog, J.C., Guttman, J.D.: Strand spaces: Proving security protocols correct. Journal of Computer Security 7(2/3), 191–230 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mukhamedov, A., Kremer, S., Ritter, E. (2005). Analysis of a Multi-party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space Model. In: Patrick, A.S., Yung, M. (eds) Financial Cryptography and Data Security. FC 2005. Lecture Notes in Computer Science, vol 3570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11507840_23

Download citation

  • DOI: https://doi.org/10.1007/11507840_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26656-3

  • Online ISBN: 978-3-540-31680-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics