Abstract
The notion of rational exchange introduced by Syverson in 1998 is a particularly interesting alternative when an efficient scheme for fair exchange is required but the use of a trusted third party is not allowed. A rational exchange protocol cannot provide fairness, but it ensures that rational (i.e. self-interested) parties would have no reason to deviate from the protocol. Buttyán et al (2003) have recently pointed out how rationality in exchange protocols can be formalized and studied within the framework provided by Game Theory. In this paper, we identify some vulnerabilities in Syverson’s protocol which were not detected by Buttyán et al’s analysis. These motivate us to extend the model to consider new aspects, never formalized before when analyzing security protocols. These aspects are related to participants’ reputation, protocol’s robustness, and the impact that scenarios where the protocol is executed repeatedly have on the outcome of the protocol execution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buttyán, L., Hubaux, J.-P.: Rational Exchange - A Formal Model Based on Game Theory. In: Fiege, L., Mühl, G., Wilhelm, U.G. (eds.) WELCOM 2001. LNCS, vol. 2232, p. 114. Springer, Heidelberg (2001)
Buttyán, L., Hubaux, J.P.: A formal Analysis of Syverson’s Rational Exchange protocol. In: Proceedings of the 15th IEEE Computer Security Foundations Workshop, pp. 181–193 (June 2002)
Buttyán, L., Hubaux, J.P., Čapkun, S.: A Formal Model of Rational Exchange and Its Application to the Analysis of Syverson’s Protocol. Journal of Computer Security 12(3/4), 551–588 (2004)
Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory 29, 198–208 (1983)
Denning, D.E.: The limits of Formal Security Models. National Computer System Security Award Acceptance Speech (1999)
Gibbons, R.: Game Theory for Applied Economists. Princeton University Press, Princeton (1992)
[ISO/IEC 13888-3] Information Security. Security Techniques. Non Repudiation (1997)
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)
Kremer, S., Raskin, J.F.: A game Approach to the Verification of Exchange Protocols. In: Proceedings of the 1st Workshop on Issues in the Theory of Security (July 2000)
Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of fair non-repudiation protocols. Computer Communications 25(17), 1606–1621 (2002)
Kremer, S.: Formal Analysis of Optimistic Fair Exchange Protocol. PhD Thesis. Universit Libre de Bruxelles. Facult de Sciences (2003-04)
Needham, R.M.: The changing environment for security protocols. IEEE Network 11(3), 12–15 (1997)
Nurmi, P.: A framework for online reputation systems. Department of Computer Science, University of Helsinki (March 2005)
Pagnia, H., Gärtner, F.C.: On the impossibility of fair exchange without a trusted third party. Darmstadt University of Technology, Department of Computer Science. Technical Report TUD-BS-1999-02 (March 1999)
Syverson, P.: Weakly secret bit commitment: Applications to lotteries and fair exchange. In: Proceedings of the 11th IEEE Computer Security Foundations Workshop, pp. 2–13 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alcaide, A., Estevez-Tapiador, J.M., Hernandez-Castro, J.C., Ribagorda, A. (2006). An Extended Model of Rational Exchange Based on Dynamic Games of Imperfect Information. In: Müller, G. (eds) Emerging Trends in Information and Communication Security. ETRICS 2006. Lecture Notes in Computer Science, vol 3995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11766155_28
Download citation
DOI: https://doi.org/10.1007/11766155_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34640-1
Online ISBN: 978-3-540-34642-5
eBook Packages: Computer ScienceComputer Science (R0)