Advertisement

Risk Balance in Exchange Protocols

  • Mohammad Torabi Dashti
  • Yanjing Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4846)

Abstract

We study the behaviour of rational agents in exchange protocols which rely on trustees. We allow malicious parties to compromise the trustee by paying a cost and, thereby, present a game analysis that advocates exchange protocols which induce balanced risks on the participants. We also present a risk-balanced protocol for fair confidential secret comparison.

Keywords

Nash Equilibrium Hash Function Exchange Protocol Fair Exchange Game Analysis 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asokan, N.: Fairness in electronic commerce. PhD thesis, University of Waterloo (1998)Google Scholar
  2. 2.
    Buttyán, L., Hubaux, J.: Toward a formal model of fair exchange – a game theoretic approach. Technical Report SSC/1999/39, EPFL, Lausanne (1999)Google Scholar
  3. 3.
    Buttyán, L., Hubaux, J., Capkun, S.: A formal model of rational exchange and its application to the analysis of syverson’s protocol. J. Computer Security 12(3-4), 551–587 (2004)Google Scholar
  4. 4.
    Cachin, C., Camenisch, J.: Optimistic fair secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 93–111. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Chadha, R., Mitchell, J., Scedrov, A., Shmatikov, V.: Contract signing, optimism, and advantage. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 366–382. Springer, Heidelberg (2003)Google Scholar
  6. 6.
    Even, S., Yacobi, Y.: Relations among public key signature systems. Technical Report 175, Computer Science Dept., Technion, Haifa, March (1980)Google Scholar
  7. 7.
    Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Commun. ACM 39(5), 77–85 (1996)CrossRefGoogle Scholar
  8. 8.
    Gollmann, D.: Why trust is bad for security. ENTCS 157(3), 3–9 (2006)Google Scholar
  9. 9.
    Imamoto, K., Zhou, J., Sakurai, K.: An evenhanded certified email system for contract signing. In: Qing, S., Mao, W., Lopez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 1–13. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Ito, C., Iwaihara, M., Kambayashi, Y.: Fair exchange under limited trust. In: Buchmann, A.P., Casati, F., Fiege, L., Hsu, M.-C., Shan, M.-C. (eds.) TES 2002. LNCS, vol. 2444, pp. 161–170. Springer, Heidelberg (2002)Google Scholar
  11. 11.
    Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Redmond, Washington (1999)Google Scholar
  12. 12.
    Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Teepe, W.: Reconciling Information Exchange and Confidentiality — A Formal Approach. PhD thesis, Rijksuniversiteit Groningen (2006)Google Scholar
  14. 14.
    Traore, J., Boudot, F., Schoenmakers, B.: A fair and efficient solution to the socialist millionaires’ problem. Discrete Applied Mathematics 111, 23–36 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Zhou, J., Gollmann, D.: A fair non-repudiation protocol. In: Privacy 1996, pp. 55–61. IEEE Computer Society Press, Los Alamitos (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mohammad Torabi Dashti
    • 1
  • Yanjing Wang
    • 1
  1. 1.CWI, Amsterdam 

Personalised recommendations