Advertisement

Nature–Inspired Synthesis of Rational Protocols

  • Almudena Alcaide
  • Juan M. E. Tapiador
  • Julio C. Hernandez-Castro
  • Arturo Ribagorda
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)

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.

Keywords

Simulated Annealing Rational Exchange Trusted Third Party State Matrix Rational 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Kremer, S.: Formal analysis of optimistic fair exchange protocols. Technical report, Université Libre de Bruxelles. Faculté de Sciences Ph.D. Thesis (2003)Google Scholar
  5. 5.
    Clark, J., Jacob, J.: Protocols are programs too: the meta-heuristic search for security protocols. Information and Software Technology 43, 891–904 (2001)CrossRefGoogle Scholar
  6. 6.
    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 SecurityCrossRefMathSciNetGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Park, K., Hong, C.: Cryptographic protocol design concept with genetic algorithms. In: KES (2), pp. 483–489 (2005)Google Scholar
  9. 9.
    Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Almudena Alcaide
    • 1
  • Juan M. E. Tapiador
    • 1
  • Julio C. Hernandez-Castro
    • 1
  • Arturo Ribagorda
    • 1
  1. 1.Computer Science DepartmentCarlos III University of MadridLeganesMadrid

Personalised recommendations