An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items

  • Masayuki Terada
  • Kensaku Mori
  • Sadayuki Hongo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3928)


Fair exchange protocols are important in realizing safe electronic commerce. In particular, optimistic fair exchange protocols, which involve a trusted third party only when mutual communication between exchanging parties fails, are the most promising development because of their efficiency. Unfortunately, however, existing optimistic protocols place restrictions on the items that can be exchanged, i.e., at least one item must be a “strongly generatable” item such as a digital signature. Without this requirement, only weak fairness that requires (expensive) external dispute resolution processes (e.g. trials in court) after exchange failure can be assured. This paper proposes a novel fair exchange method that enables parties to fairly exchange arbitrary items in an optimistic manner. This is achieved by realizing an optimistic non-blocking atomic commitment (NBAC) protocol between two smartcards and adapting the known result that fair exchange can be reduced to NBAC among trusted processes.


Electronic Commerce Optimistic Protocol Fair Exchange Mobile Phone Network Main Protocol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Zhou, J. (ed.): Non-repudiation in electronic commerce, Artech House, Norwood, MA, USA (2001)Google Scholar
  2. 2.
    Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of fair non-repudiation protocols. Computer Communications 25, 1606–1621 (2002)CrossRefGoogle Scholar
  3. 3.
    Pagnia, H., Vogt, H., Gärtner, F.C.: Fair exchange. The Computer Journal 46, 55–75 (2003)CrossRefMATHGoogle Scholar
  4. 4.
    Asokan, N.: Fairness in Electronic Commerce. PhD thesis, University of Waterloo (1998)Google Scholar
  5. 5.
    Schunter, M.: Optimistic Fair Exchange. PhD thesis, Universität des Saarlandes (2000) Google Scholar
  6. 6.
    Terada, M., Iguchi, M., Hanadate, M., Fujimura, K.: An optimistic fair exchange protocol for trading electronic rights. In: Proc. 6th Working Conference on Smart Card Research and Advanced Applications (CARDIS 2004), IFIP, pp. 255–270 (2004)Google Scholar
  7. 7.
    Fujimura, K., Eastlake, D.: RFC 3506: Requirements and Design for Voucher Trading System, VTS (2003)Google Scholar
  8. 8.
    Avoine, G., Gärtner, F., Guerraoui, R., Kursawe, K., Vaudenay, S., Vukolic, M.: Reducing fair exchange to atomic commit. Technical Report 200411, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland (2004)Google Scholar
  9. 9.
    Vogt, H.: Asynchronous optimistic fair exchange based on revocable items. In: Proc. 7th International Financial Cryptography Conference, IFCA, pp. 208–222 (2003)Google Scholar
  10. 10.
    Vogt, H., Pagnia, H., Gärtner, F.C.: Modular fair exchange protocols for electronic commerce. In: Proc. 15th Annual Computer Security Applications Conference, pp. 3–11 (1999)Google Scholar
  11. 11.
    Terada, M., Kuno, H., Hanadate, M., Fujimura, K.: Copy prevention scheme for rights trading infrastructure. In: Proc. 4th Working Conference on Smart Card Research and Advanced Applications (CARDIS 2000), IFIP, pp. 51–70 (2000)Google Scholar
  12. 12.
    Avoine, G., Gärtner, F., Guerraoui, R., Vukolic, M.: Gracefully degrading fair exchange with security modules. In: Proc. 5th European Dependable Computing Conference (EDCC), pp. 55–71 (2005)Google Scholar
  13. 13.
    Guerraoui, R.: Revisiting the relationship between non-blocking atomic commitment and consensus. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 87–100. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  14. 14.
    Skeen, D.: Nonblocking commit protocols. In: Proc. 1981 ACM SIGMOD International Conference on Management of Data, pp. 133–142 (1981)Google Scholar
  15. 15.
    Gray, J., Lamport, L.: Consensus on transaction commit. Technical Report MSRTR- 2003-96, Microsoft Research (2004)Google Scholar
  16. 16.
    Terada, M., Mori, K., Ishii, K., Hongo, S., Usaka, T., Koshizuka, N., Sakamura, K.: TENeT: A framework for distributed smartcards. In: Hutter, D., Ullmann, M. (eds.) SPC 2005. LNCS, vol. 3450, pp. 3–17. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  17. 17.
    Vogt, H., Pagnia, H., Gärtner, F.C.: Using smart cards for fair exchange. In: Fiege, L., Mühl, G., Wilhelm, U.G. (eds.) WELCOM 2001. LNCS, vol. 2232, pp. 101–113. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  18. 18.
    Vogt, H., Gärtner, F.C., Pagnia, H.: Supporting fair exchange in mobile environments. ACM/Kluwer Journal on Mobile Network and Applications (MONET) 8, 127–136 (2003)CrossRefMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Masayuki Terada
    • 1
  • Kensaku Mori
    • 1
  • Sadayuki Hongo
    • 1
  1. 1.NTT DoCoMo, Inc.KanagawaJapan

Personalised recommendations