MODEL CHECKING A KNOWLEDGE EXCHANGE SCENARIO

We are interested in applying model checking techniques to the verification of communication protocols that require safe communication. Typically, in such scenarios, one desires to demonstrate that one party can reliably communicate information to another party without a third party being able to determine this information. Our approach involves using the modal logic of knowledge, which has only relatively recently been studied in the context of security protocols. We demonstrate our approach by means of a detailed case study: the Russian cards problem. This is an example of a security protocol with nontrivial requirements on the knowledge of the agents involved. Using the Russian cards problem as an example, it is shown how the satisfaction of properties involving knowledge can be verified in a standard model checker, which in our case is SPIN.

[1]  W. van der Hoek,et al.  Epistemic logic for AI and computer science , 1995, Cambridge tracts in theoretical computer science.

[2]  Kaile Su,et al.  Symbolic model checking the knowledge of the dining cryptographers , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..

[3]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[4]  J. Hintikka.  Knowledge and belief , 1962 .

[5]  Michael Wooldridge,et al.  Model Checking Knowledge and Time , 2002, SPIN.

[6]  Martín Abadi,et al.  A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[7]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[8]  Joseph Y. Halpern,et al.  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[9]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[10]  Dennis Dams,et al.  Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography) , 2002, SPIN.

[11]  H. V. Ditmarsch.  OUCS-2002-08 The Russian cards problem : a case study in cryptography with public announcements , 2002 .

[12]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[13]  Gavin Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.

[14]  Hans van Ditmarsch,et al.  The Russian Cards Problem , 2003, Stud Logica.

[15]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[16]  Stephan Merz,et al.  Model Checking , 2000 .

[17]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[18]  Jaakko Hintikka,et al.  Knowledge and Belief: An Introduction to the Logic of the Two Notions. , 1965 .

[19]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .