Skip to main content
SpringerLink
Log in

Fair Exchange with Guardian Angels

  • Conference paper
Information Security Applications (WISA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2908))

Included in the following conference series:

Abstract

In this paper we propose a new probabilistic Fair Exchange Protocol which requires no central Trusted Third Party. Instead, it relies on a virtually distributed and decentralized Trusted Third Party which is formalized as a Guardian Angel: a kind of Observer e.g. a tamper proof security device. We thus introduce a network model with Pirates and Guardian Angels which is well suited for Ad Hoc networks.

In this setting we reduce the Fair Exchange Problem to a Synchronization Problem in which honest parties need to eventually decide whether or not a protocol succeeded in a synchronous way through a hostile network which does not guaranty that sent messages will be eventually received. This problem can be of independent interest in order to add reliability of protocol termination in secure channels.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. Research Report RZ 2858, IBM Research Division, Zurich, Switzerland (September 1996)

    Google Scholar 

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

    Google Scholar 

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

    Chapter  Google Scholar 

  4. Asokan, N., Shoup, V., Waidner, M.: Asynchronous protocols for optimistic fair exchange. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, USA, May 1998, pp. 86–99. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  5. Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 591–606. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.L.: A fair protocol for signing contracts. IEEE Transactions on Information Theory 36(1), 40–46 (1990)

    Article  Google Scholar 

  7. Berclaz, J., Vaquin, S.: Fair exchange between iPAQs. Semester project, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland (February 2002), http://lasecwww.epfl.ch

  8. Brickell, E.F., Chaum, D., Damgård, I.B., van de Graaf, J.: Gradual and verifiable release of a secret. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 156–166. Springer, Heidelberg (1988)

    Google Scholar 

  9. Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)

    Google Scholar 

  10. Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 573–588. Springer, Heidelberg (1990)

    Google Scholar 

  11. Damgård, I.B.: Practical and probably secure release of a secret and exchange of signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 200–217. Springer, Heidelberg (1994)

    Google Scholar 

  12. Dierks, T., Allen, C.: The TLS protocol – version 1.0 (January 1999)

    Google Scholar 

  13. Even, S., Yacobi, Y.: Relations amoung public key signature systems. Technical Report 175, Computer Science Department, Technicon, Israel (1980)

    Google Scholar 

  14. Franklin, M., Reiter, M.K.: Fair exchange with a semi-trusted third party. In: Proceedings of the 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, April 1997, pp. 1–5. ACM Press, New York (1997)

    Chapter  Google Scholar 

  15. Franklin, M., 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 

  16. Gärtner, F.C., Pagnia, H., Vogt, H.: Approaching a formal definition of fairness in electronic commerce. In: Proceedings of the International Workshop on Electronic Commerce – WELCOM 1999, Lausanne, Switzerland, October 1999, pp. 354–359. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  17. Guerraoui, R.: Revisiting the relationship between non-blocking atomic commitment and consensus. In: Hélary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 87–100. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  18. Guerraoui, R.: Non-blocking atomic commit in asynchronous distributed systems with failure detectors. Distributed Computing 15(1), 17–25 (2002)

    Article  Google Scholar 

  19. Hubaux, J.-P., Le Boudec, J.-Y., Giordano, S., Hamdi, M.: The terminode project: Toward mobile ad-hoc wans. In: Proceedings of the Sixth IEEE International Workshop on Mobile, Multimedia Communications – Mo-MuC 1999, San-Diego, California, USA (1999)

    Google Scholar 

  20. Hubaux, J.-P., Gross, T., Le Boudec, J.-Y., Vetterli, M.: Towards self-organizing mobile ad-hoc networks: the terminodes project. IEEE Comm. Mag. 39(1), 118–124 (2001)

    Article  Google Scholar 

  21. Jakobsson, M.: Ripping coins for a fair exchange. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 220–230. Springer, Heidelberg (1995)

    Google Scholar 

  22. Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of nonrepudiation protocols. Technical Report ULB–474, Université Libre de Bruxelles, Bruxelles, Belgium (2001)

    Google Scholar 

  23. Markowitch, O.: Les protocoles de non-répudiation. PhD thesis, University of Bruxelles, Bruxelles, Belgium (January 2001)

    Google Scholar 

  24. Markowitch, O., Saeednia, S.: Optimistic fair exchange with transparent signature recovery. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, p. 329. Springer, Heidelberg (2002)

    Google Scholar 

  25. Okamoto, T., Ohta, K.: How to simultaneously exchange secrets by general assumptions. In: Proceedings of the 2nd ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, November 1994, pp. 184–192. ACM Press, New York (1994)

    Chapter  Google Scholar 

  26. Pagnia, H., Vogt, H., Gärtner, F.C.: Fair exchange. The computer Journal 46(1), 55–75 (2003)

    Article  MATH  Google Scholar 

  27. Rabin, M.O.: Transaction protection by beacons. Journal of Computer and System Science 27(2), 256–267 (1883)

    Article  MathSciNet  Google Scholar 

  28. Ray, I., Ray, I.: An optimistic fair exchange e-commerce protocol with automated dispute resolution. In: Bauknecht, K., Madria, S.K., Pernul, G. (eds.) EC-Web 2000. LNCS, vol. 1875, pp. 84–93. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  29. Schunter, M.: Optimistic Fair Exchange. PhD thesis, University of Saarlandes, Saarbruken, Germany (October 2000)

    Google Scholar 

  30. Syverson, P.: Weakly secret bit commitment: Applications to lotteries and fair exchange. In: Proceedings of the 11th Computer Security Foundations Workshop – PCSFW, IEEE, Rockport, Massachusetts, USA, June 1998, pp. 2–13. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  31. Tedrick, T.: How to exchange half a bit. In: Chaum, D. (ed.) Advances in Cryptology – CRYPTO 1983, pp. 147–151. Plenum Press, New York (1983)

    Google Scholar 

  32. Tedrick, T.: Fair exchange of secrets. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 434–438. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  33. Vogt, H.: Asynchronous optimistic fair exchange based on revocable items. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 208–222. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  34. Vogt, H., Gärtner, F.C., Pagnia, H.: Supporting fair exchange in mobile environments. Journal on Mobile Networks and Applications 8(2), 127–136 (2003)

    Article  Google Scholar 

  35. Vogt, H., Pagnia, H., Gärtner, F.C.: Using smart cards for fair exchange. In: Fiege, L., Mühl, G., Wilhelm, U. (eds.) WELCOM 2001. LNCS, vol. 2232, pp. 101–113. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  36. Zhou, J., Deng, R., Bao, F.: Evolution of fair non repudiation with TTP. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol. 1587, pp. 258–269. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  37. Zhou, J., Deng, R., Bao, F.: Some remarks on a fair exchange protocol. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 46–57. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Swiss Federal Institute of Technology (EPFL),  

    Gildas Avoine & Serge Vaudenay

Authors
  1. Gildas Avoine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serge Vaudenay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Ewha Womans University, Korea

    Ki-Joon Chae

  2. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, NY 10027, New York, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avoine, G., Vaudenay, S. (2004). Fair Exchange with Guardian Angels. In: Chae, KJ., Yung, M. (eds) Information Security Applications. WISA 2003. Lecture Notes in Computer Science, vol 2908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24591-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24591-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24591-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation