Advertisement

Unconditionally Secure Protocols with Genetic Algorithms

  • Ignacio Hernández-Antón
  • Fernando Soler-Toscano
  • Hans van Ditmarsch
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 156)

Abstract

This paper presents genetic algorithms as a tool for searching unconditionally secure protocols in card game scenarios. We model cards protocols with genetic algorithms and run an experiment to determine the influence of weighing differently the protocol requirements.

Keywords

Genetic Algorithm Search Time Secure Protocol Elliptic Curve Cryptography Initial Population Size 
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.
    Albert, M., Aldred, R., Atkinson, M., van Ditmarsch, H., Handley, C.: Safe communication for card players by combinatorial designs for two-step protocols. Australasian Journal of Combinatorics 33, 33–46 (2005)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Albert, M., Cordón-Franco, A., van Ditmarsch, H., Fernández-Duque, D., Joosten, J.J., Soler-Toscano, F.: Secure Communication of Local States in Interpreted Systems. In: Abraham, A., Corchado, J.M., González, S.R., De Paz Santana, J.F. (eds.) International Symposium on Distributed Computing and Artificial Intelligence. AISC, vol. 91, pp. 117–124. Springer, Heidelberg (2011)Google Scholar
  3. 3.
    van Ditmarsch, H.: The Russian cards problem. Studia Logica 75, 31–62 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Synthese Library, vol. 337. Springer, Heidelberg (2007)Google Scholar
  5. 5.
    Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)zbMATHGoogle Scholar
  6. 6.
    Fischer, M., Wright, R.: Bounds on secret key exchange using a random deal of cards. Journal of Cryptology 9(2), 71–99 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Kumar, A., Ghose, M.K.: Overview of information security using genetic algorithm and chaos. Information Security Journal: A Global Perspective 18(6), 306–315 (2009)CrossRefGoogle Scholar
  8. 8.
    Ocenasek, P.: Evolutionary approach in the security protocols design. In: Blyth, A. (ed.) EC2ND 2005, pp. 147–156. Springer, London (2006)CrossRefGoogle Scholar
  9. 9.
    Plaza, J.: Logics of public communications. In: Emrich, M., et al. (eds.) Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems, pp. 201–216 (1989)Google Scholar
  10. 10.
    Whitley, D.: A genetic algorithm tutorial. Statistics and Computing 4, 65–85 (1994)CrossRefGoogle Scholar
  11. 11.
    Zarza, L., Pegueroles, J., Soriano, M.: Evaluation function for synthesizing security protocols by means of genetic algorithms (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ignacio Hernández-Antón
    • 1
  • Fernando Soler-Toscano
    • 1
  • Hans van Ditmarsch
    • 1
  1. 1.University of SevillaSevillaSpain

Personalised recommendations