Abstract
Rational cryptography is an emerging field which combines aspects traditionally related to security with concepts described in economic theoretical frameworks. For example, it applies game theory concepts to address security problems arising when executing cryptographic protocols. The aim is to replace the assumption of a worst–case attacker by the notion of rational agents that try to maximize their payoffs. In this work, we define a formal framework and a meta–heuristic technique for the automated synthesis of multi–party rational exchange security (M–RES) protocols. We provide experimental results for a simple scenario where a 3–party rational exchange protocol is automatically designed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pagnia, H., Gärtner, F.: On the impossibility of fair exchange without a trusted third party. Technical report, Darmstadt University of Technology, Department of Computer Science (1999)
Buttyán, L.: Building blocks for secure services: Authenticated key transport and rational exchange protocols. Technical report, Swiss Federal Institute of Technology. Lausanne (EPFL), Ph.D. Thesis No. 2511 (2001)
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)
Kremer, S.: Formal analysis of optimistic fair exchange protocols. Technical report, Université Libre de Bruxelles. Faculté de Sciences Ph.D. Thesis (2003)
Clark, J., Jacob, J.: Protocols are programs too: the meta-heuristic search for security protocols. Information and Software Technology 43, 891–904 (2001)
Chen, H., Clark, J., Jacob, J.: Automatic design of security protocols. Computational Intelligence 20, 503–516 (2004); Special Issue on Evolutionary Computing in Cryptography and Security
Clark, J., Jacob, J.: Searching for a solution: engineering tradeoffs and the evolution of provably secure protocols. In: Proceedings IEEE Symposium on Security and Privacy (2002)
Park, K., Hong, C.: Cryptographic protocol design concept with genetic algorithms. In: KES (2), pp. 483–489 (2005)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Alcaide, A., Estévez-Tapiador, J., Hernandez Castro, J., Ribagorda, A.: A multi-party rational exchange protocol. In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM 2007, Part I. LNCS, vol. 4805, pp. 42–43. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alcaide, A., Tapiador, J.M.E., Hernandez-Castro, J.C., Ribagorda, A. (2008). Nature–Inspired Synthesis of Rational Protocols. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds) Parallel Problem Solving from Nature – PPSN X. PPSN 2008. Lecture Notes in Computer Science, vol 5199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87700-4_97
Download citation
DOI: https://doi.org/10.1007/978-3-540-87700-4_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87699-1
Online ISBN: 978-3-540-87700-4
eBook Packages: Computer ScienceComputer Science (R0)