Skip to main content

Three Steps

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6814))

Abstract

Given is a deal of ten cards over three players, such that two players each get four cards and the remaining player (the ‘eavesdropper’) two cards. We show that there does not exist a protocol of two steps for the four-card players to inform each other safely of their hands of cards, and we then present a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checking) means. No such three-step protocol for cards was known. The method can be generalized. This will advance the characterization of card deals for which such exchanges of secrets are possible.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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.H., Aldred, R.E.L., Atkinson, M.D., van Ditmarsch, H., Handley, C.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.H., 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. (eds.) International Symposium on Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol. 91, pp. 117–124. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements, common knowledge, and private suspicions. In: Gilboa, I. (ed.) Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 1998), pp. 43–56 (1998)

    Google Scholar 

  4. Dixon, C.: Using temporal logics of knowledge for specification and verification–a case study. Journal of Applied Logic 4(1), 50–78 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dobcsányi, P.: Design db (2011), http://batman.cs.dal.ca/~peter/designdb/

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

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Kerckhoffs, A.: La cryptographie militaire. Journal Des Sciences Militaires IX, 5–38, 161–191 (1883)

    Google Scholar 

  9. Kirkman, T.: On a problem in combinations. Camb. and Dublin Math. J. 2, 191–204 (1847)

    Google Scholar 

  10. Koizumi, K., Mizuki, T., Nishizeki, T.: Necessary and sufficient numbers of cards for the transformation protocol. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 92–101. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Luo, X., Su, K., Sattar, A., Chen, Y.: Solving sum and product riddle via bdd-based model checking. In: Web Intelligence/IAT Workshops, pp. 630–633. IEEE, Los Alamitos (2008)

    Google Scholar 

  12. Parikh, R., Ramanujam, R.: A knowledge based semantics of messages. Journal of Logic, Language and Information 12, 453–467 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Plaza, J.A.: Logics of public communications. In: Emrich, M.L., Pfeifer, M.S., Hadzikadic, M., Ras, Z.W. (eds.) Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems: Poster Session Program, pp. 201–216. Oak Ridge National Laboratory (1989)

    Google Scholar 

  14. Stiglic, A.: Computations with a deck of cards. Theoretical Computer Science 259(1-2), 671–678 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  15. Stinson, D.R.: Combinatorial Designs – Constructions and Analysis. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  16. van Ditmarsch, H.: The Russian cards problem. Studia Logica 75, 31–62 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  17. van Ditmarsch, H., van der Hoek, W., van der Meyden, R., Ruan, J.: Model checking russian cards. Electronic Notes in Theoretical Computer Science 149, 105–123 (2006); Presented at MoChArt 2005, Model Checking in Artificial Intelligence

    Article  MATH  Google Scholar 

  18. van Eijck, J.: DEMO — a demo of epistemic modelling. In: van Benthem, J., Gabbay, D., Löwe, B. (eds.) Interactive Logic — Proceedings of the 7th Augustus de Morgan Workshop. Texts in Logic and Games, vol. 1, pp. 305–363. Amsterdam University Press, Amsterdam (2007)

    Google Scholar 

  19. van Otterloo, S., van der Hoek, W., Wooldridge, M.: Model checking a knowledge exchange scenario. Applied Artificial Intelligence 18(9-10), 937–952 (2004)

    Article  Google Scholar 

  20. Wang, Y.: Epistemic Modelling and Protocol Dynamics. PhD thesis, Universiteit van Amsterdam (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Ditmarsch, H., Soler–Toscano, F. (2011). Three Steps. In: Leite, J., Torroni, P., Ågotnes, T., Boella, G., van der Torre, L. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2011. Lecture Notes in Computer Science(), vol 6814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22359-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22359-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22358-7

  • Online ISBN: 978-3-642-22359-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics