Skip to main content

Unconditionally Secure Protocols with Genetic Algorithms

  • Conference paper
  • 735 Accesses

Part of the book series: Advances in Intelligent and Soft Computing ((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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    MathSciNet  MATH  Google Scholar 

  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. van Ditmarsch, H.: The Russian cards problem. Studia Logica 75, 31–62 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Synthese Library, vol. 337. Springer, Heidelberg (2007)

    Google Scholar 

  5. Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  6. Fischer, M., Wright, R.: Bounds on secret key exchange using a random deal of cards. Journal of Cryptology 9(2), 71–99 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  8. Ocenasek, P.: Evolutionary approach in the security protocols design. In: Blyth, A. (ed.) EC2ND 2005, pp. 147–156. Springer, London (2006)

    Chapter  Google Scholar 

  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. Whitley, D.: A genetic algorithm tutorial. Statistics and Computing 4, 65–85 (1994)

    Article  Google Scholar 

  11. Zarza, L., Pegueroles, J., Soriano, M.: Evaluation function for synthesizing security protocols by means of genetic algorithms (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ignacio Hernández-Antón .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hernández-Antón, I., Soler-Toscano, F., van Ditmarsch, H. (2012). Unconditionally Secure Protocols with Genetic Algorithms. In: Pérez, J., et al. Highlights on Practical Applications of Agents and Multi-Agent Systems. Advances in Intelligent and Soft Computing, vol 156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28762-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28762-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28761-9

  • Online ISBN: 978-3-642-28762-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics