Advertisement

Mobile Networks and Applications

, Volume 8, Issue 2, pp 127–136 | Cite as

Supporting Fair Exchange in Mobile Environments

  • Holger Vogt
  • Felix C. Gärtner
  • Henning Pagnia
Article

Abstract

Mobile commerce over the Internet always includes the exchange of electronic goods. Fair exchange protocols establish fairness and ensure that both participants can engage in the exchange without the risk of suffering a disadvantage (e.g., losing their money without receiving anything for it). In general, fair exchange protocols require the continuous availability of an external trusted third party (TTP), a dedicated site which is trusted by both participants. Implementations of TTPs for fair exchange have been proposed to be based on carefully secured Internet hosts in order to establish trust. In this paper we present solutions to the fair exchange problem in mobile environments, where customers frequently disconnect from the network and thus continuous availability of the external TTP is not given. Our approach utilizes tamper-poof hardware on the customer's side partly taking over the duties of the TTP. Besides supporting disconnected operations our approach also allows the proper handling of time-sensitive items (i.e., items which lose value over time), a feature which previous protocols lack.

mobile commerce fair exchange disconnected operations tamper-proof hardware time-sensitive items 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    N. Asokan, Fairness in electronic commerce, Ph.D. thesis, University of Waterloo, Canada (1998).Google Scholar
  2. [2]
    N. Asokan, M. Schunter and M. Waidner, Optimistic Protocols for Fair Exchange, in: 4th ACM Conference on Computer and Communications Security, ed. T. Matsumoto, Zürich, Switzerland (ACM Press, 1997) pp. 6–17.Google Scholar
  3. [3]
    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 (1998) pp. 86–99.Google Scholar
  4. [4]
    M. Blum, How to exchange (secret) keys, ACM Transactions on Computer Systems 1(2) (1983) 175–193.Google Scholar
  5. [5]
    D. Boneh and M. Naor, Timed Commitments, in: Advances in Cryptology ‐ CRYPTO'2000, Lecture Notes in Computer Science, Vol. 1880 (Springer-Verlag, 2000) pp. 236–254.Google Scholar
  6. [6]
    E.F. Brickell, D. Chaum, I.B. Damgård and J. van de Graaf, Gradual and verifiable release of a secret, in: Advances in Cryptology ‐ CRYPTO'87, Lecture Notes in Computer Science, Vol. 293 (Springer-Verlag, 1987) pp. 156–166.Google Scholar
  7. [7]
    H. Bürk and A. Pfitzmann, Value exchange systems enabling security and unobservability, Computers & Security 9(8) (1990) 715–721.Google Scholar
  8. [8]
    L. Buttyàn, Building blocks for secure services: Autenticated key transport and rational exchange protocols, Ph.D. thesis, No. 2511, Swiss Federal Institute of Technology, Lausanne (2001).Google Scholar
  9. [9]
    L. Buttyàn and J.-P. Hubaux, Rational exchange ‐ A formal model based on game theory, in: Electronic Commerce ‐ WELCOM 2001, Lecture Notes in Computer Science, Vol. 2232 (Springer-Verlag, 2001) pp. 114–126.Google Scholar
  10. [10]
    D. Chaum, Blind signatures for untraceable payments, in: Advances in Cryptology ‐ CRYPTO'82 (Plenum, 1983) pp. 199–203.Google Scholar
  11. [11]
    D. Chaum, A. Fiat and M. Naor, Untraceable electronic cash, in: Advances in Cryptology ‐ CRYPTO'88, Lecture Notes in Computer Science, Vol. 401 (Springer-Verlag, 1988) pp. 319–327.Google Scholar
  12. [12]
    S. Even and Y. Yacobi, Relations amoung public key signature systems, Technical report 175, Computer Science Department, Technicon, Haifa, Israel (1980).Google Scholar
  13. [13]
    M.K. Franklin and M.K. Reiter, Fair exchange with a semi-trusted third party, in: 4th ACM Conference on Computer and Communications Security, ed. T. Matsumoto, Zürich, Switzerland (ACM Press, 1997) pp. 1–5.Google Scholar
  14. [14]
    IBM, The IBM 4758 PCI cryptographic coprocessor (2002) http: // www.ibm.com/security/cryptocards/Google Scholar
  15. [15]
    M. Jakobsson, Ripping coins for fair exchange, in: Advances in Cryptology ‐ EUROCRYPT'95, eds. L.C. Guillou and J.-J. Quisquater, Lecture Notes in Computer Science, Vol. 921 (Springer-Verlag, 1995) pp. 220–230.Google Scholar
  16. [16]
    G. Karjoth, Secure mobile agent-based merchant brokering in distributed marketplaces, in: Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents (ASA/MA2000), Lecture Notes in Computer Science, Vol. 1882, Zürich, Switzerland (Springer-Verlag, 2000) pp. 44–56.Google Scholar
  17. [17]
    H. Pagnia, H. Vogt, F.C. Gärtner and U.G. Wilhelm, Solving fair exchange with mobile agents, in: ASA/MA 2000, Lecture Notes in Computer Science, Vol. 1882, Zürich, Switzerland (Springer-Verlag, 2000) pp. 57–72.Google Scholar
  18. [18]
    T.W. Sandholm and V.R. Lesser, Equilibrium analysis of the possibilities of unenforced exchange in multiagent systems, in: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, ed. C.S. Mellish, San Mateo (Morgan Kaufmann, 1995) pp. 694–703.Google Scholar
  19. [19]
    B. Schoenmakers, Security aspects of the ecash payment system, in: COSIC'97 Course, Lecture Notes in Computer Science, Vol. 1528 (Springer-Verlag, 1997) pp. 338–352.Google Scholar
  20. [20]
    P. Syverson, Weakly secret bit commitment: Applications to lotteries and fair exchange, in: Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW'98), Rockport, MA(IEEE, 1998) pp. 2–13.Google Scholar
  21. [21]
    H. Vogt, H. Pagnia and F.C. Gärtner, Modular fair exchange protocols for electronic commerce, in: Proceedings of the 15th Annual Computer Security Applications Conference, Phoenix, AZ (IEEE Computer Society Press, 1999) pp. 3–11.Google Scholar
  22. [22]
    H. Vogt, H. Pagnia and F.C. Gärtner, Using smart cards for fair exchange, in: Electronic Commerce ‐ WELCOM 2001, Lecture Notes in Computer Science, Vol. 2232 (Springer-Verlag, 2001) pp. 101–113.Google Scholar
  23. [23]
    U.G. Wilhelm, A technical approach to privacy based on mobile agents protected by tamper-resistant hardware, Ph.D. thesis, École Polytechnique Fédérale de Lausanne, Switzerland (1999).Google Scholar
  24. [24]
    J. Zhou and D. Gollmann, A fair non-repudiation protocol, in: Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA (IEEE Computer Society Press, 1996) pp. 55–61.Google Scholar
  25. [25]
    J. Zhou and D. Gollmann, An efficient non-repudiation protocol, in: Proceedings of the 10th IEEE Computer Security Foundations Workshop (IEEE Computer Society Press, 1997) pp. 126–132.Google Scholar
  26. [26]
    J. Zhou and K.-Y. Lam, A secure pay-per-view scheme for Web-based video service, in: Public Key Cryptography ‐ PKC'99, Lecture Notes in Computer Science, Vol. 1560 (Springer-Verlag, 1999) pp. 315–326.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Holger Vogt
    • 1
  • Felix C. Gärtner
    • 1
  • Henning Pagnia
    • 1
  1. 1.Department of Computer ScienceDarmstadt University of TechnologyDarmstadtGermany

Personalised recommendations