Abstract
A central question in knowledge theory relates to how knowers update their knowledge on receipt of a communication. This is important, since the very purpose of communications is (typically) to create such an update of knowledge in the recipient. However, there is often a lack of concordance between the intended update and that which occurs, leading to interesting situations and much work for knowledge theorists
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
References
R. Anderson and R.M. Needham. Programming Satan’s computer. In Computer Science Today, volume 1000 of Lecture Notes in Computer Science, pages 426–441. Springer, Berlin, Germany, 1995.
A. Baskar, R. Ramanujam, and S.P. Suresh. Knowledge-based modelling of voting protocols. In D. Samet, editor, Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, pages 62–71. Brussels, Belgium, June 25–27, 2007.
M. Burrows, M. Abadi, and R.M. Needham. A logic of authentication. ACM Transactions on Computer Systems, 8(1):18–36, February 1990.
M. Cohen and M. Dam. A completeness result for BAN logic. In 2005 International Workshop on Methods for Modalities (M4M-05), pages 202–219. Berlin, Germany, December 1–2, 2005.
M. Cohen and M. Dam. A complete axiomatization of knowledge and cryptography. In 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), pages 77–88. IEEE Computer Society, Wroclaw, Poland, 2007.
D. Dolev and A. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 29:198–208, 1983.
N.A. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov. The undecidability of bounded security protocols. In Proceedings of the Workshop on Formal Methods and Security Protocols (FMSP’99). Trento, Italy, July 11–12, 1999.
C. Dwork and Y. Moses. Knowledge and common knowledge in a byzantine environment: Crash Failures. Information and Computation, 88(2):156–186, 1990.
S. Even and O. Goldreich. On the Security of Multi-party Ping-pong Protocols. Technical Report 285, Technion–-Israel Institute of Technology, 1983.
R. Fagin, J.Y. Halpern, Y. Moses, and M.Y. Vardi. Reasoning about Knowledge. M.I.T. Press, Cambridge, MA, 1995.
J.Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 3(3):549–587, 1990.
J.Y. Halpern and R. Pucella. Modeling adversaries in a logic for security protocol analysis. In Formal Aspects of Security, First International Conference, FASec 2002, volume 2629 of Lecture Notes in Computer Science, pages 115–132. Springer, Berlin, Germany, 2003.
N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, CA, 1996.
D.M. Nessett. A critique of the Burrows, Abadi and Needham logic. ACM Operating systems review, 24(2):35–38, 1990.
R. Parikh. Logical omniscience and common knowledge: WHAT do we know and what do WE know? In Proceedings of TARK 2005, pages 62–77. Singapore, June 10–12, 2005.
R. Ramanujam and S.P. Suresh. Decidability of context-explicit security protocols. Journal of Computer Security, 13(1):135–165, 2005.
R. Ramanujam and S.P. Suresh. A (restricted) quantifier elimination for security protocols. Theoretical Computer Science, 367:228–256, 2006.
M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions and composed keys is NP-complete. Theoretical Computer Science, 299:451–475, 2003.
S.P. Suresh. Foundations of Security Protocol Analysis. PhD thesis, The Institute of Mathematical Sciences, Chennai, India, November 2003. Madras University. Available at http://www.cmi.ac.in/~spsuresh
P.F. Syverson and P.C. van Oorschot. On unifying some cryptographic protocol logics. In Proceedings of the 13th IEEE Symposium on security and privacy, pages 14–28. IEEE Press, Oakland, California, May 16–18, 1994.
R. van der Meyden and T. Wilke. Preservation of epistemic properties in security protocol implementations. In D. Samet, editor, Proceedings of TARK ’07, pages 212–221. Brussels, Belgium, June 25–27, 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Ramanujam, R., Suresh, S. (2011). Challenges for Decidable Epistemic Logics from Security Protocols. In: van Benthem, J., Gupta, A., Pacuit, E. (eds) Games, Norms and Reasons. Synthese Library, vol 353. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0714-6_13
Download citation
DOI: https://doi.org/10.1007/978-94-007-0714-6_13
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0713-9
Online ISBN: 978-94-007-0714-6
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)