Symbolic model checking the knowledge of the Dining Cryptographers

Proceedings of the Computer Security Foundations Workshop

Volumn 17, Issue , 2004, Pages 280-291

  Van Der Meyden, Ron Der ^a   Su, Kaile ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SPECIFICATIONS;

DINING CRYPTOGRAPHERS PROTOCOLS; MODEL CHECKING; SYMBOLIC MODELS; TEMPORAL LOGIC;

CODES (SYMBOLS);

EID: 4944250729     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. M. Abadi and M. Tuttle. A semantics for a logic of authentication. In Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pages 201-216, 1991.
2. M. Benerecetti and F. Giunchiglia. Model checking security protocols using a logic of belief. In S. Graf and M. Schwartzbach, editors, Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), volume LNCS No. 1785, pages 519-534, Berlin, 2000. Springer.
3. M. Benerecetti, F. Giunchiglia, and L. Serafini. A model checking algorithm for multi-agent systems. In J. Muller, M. Singh, and A. Rao, editors, Intelligent Agents V, volume LNAI Vol. 1555. Springer-Verlag, Berlin, 1999.
4. 20 states and beyond. In Proc. Symposium on Logic in Computer Science, pages 428-439. IEEE, 1990.
5. M. Burrows, M. Abadi, and R. M. Needham. A logic of authentication. ACM Transactions on Computer Systems, 8(1), 1990.
6. D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. J., Cryptology, (1):65-75, 1988.
7. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
8. E. Clarke, S. Jha, and W. Marrero. A machine checkable logic of knowledge for specifying security properties of electronic commerce protocols. In LICS Security Workshop, 1998.
9. D. Dolev and A. Yao. On the security of public-key protocols. Communications of the ACM, 29(8):198-208, August 1983.
10. R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about knowledge. MIT Press, Cambridge, MA, 1995.
11. S. Goel, M. Robson, M. Polte, and E. G. Sirer. Herbivore: A scalable and efficient protocol for anonymous communication. Technical Report TR2003-1890, Cornell University Computing and Information Science, Feb 2003.
12. N. Gorogiannis and M. D. Ryan. Implementation of belief change operators using bdds. Studia Logica, 70(1), 2001.
13. J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment J. ACM, 37(3):549-587, 1990.
14. J. Halpern and M. Y. Vardi. Model checking vs. theorem proving: A manifesto. Technical Report RJ 7963, IBM Al-maden Research Center, 1991. An extended version of a paper in Proc. 2nd Int. Conf. on Principles of Knowledge Representation and Reasoning, 1991.
15. J. Halpern and M. Y. Vardi. Model checking vs. theorem proving: A manifesto. Technical Report RJ 7963, IBM Al-maden Research Center, 1991. An extended version of a paper in Proc. 2nd Int. Conf. on Principles of Knowledge Representation and Reasoning, 1991.
16. J. Y. Halpern and K. R. O'Neill. Anonymity and information hiding in multiagent systems. In IEEE Computer Security Foundations Workshop, pages 75-88, 2003.
17. J. Y. Halpern and M. R. Tuttle. Knowledge, probability, and adversaries. J. ACM, 40(4):917-962, 1993. A preliminary version appears in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 103-118.
18. J. Y. Halpern and M. R. Tuttle. Knowledge, probability, and adversaries. J. ACM, 40(4):917-962, 1993. A preliminary version appears in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 103-118.
19. J. G. Henriksen, J. L. Jensen, M. E. Jorgensen, N. Klarlund, R. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for Construction and Analysis of Systems, First Mternational Workshop, TACAS'95, LNCS Vol. 1019, pages 89-110, 1995.
20. W. van der Hoek and M. Wooldridge. Model checking knowledge and time. In 9th Workshop on SPIN (Model Checking Software), Grenoble, April 2002.
21. M. L. Hui and G. Lowe. Simplifying transformations for security protocols. In Proc. 12th IEEE Computer Security Foundations Workshop, pages 32-43, 1999.
22. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Margaria and Steffen, editors, Tools and Algorithms for the Construction and Analysis of Systems, Vol 1055 of Lecture Notes in Computer Science, pages 147-166. Springer Verlag, 1996.
23. R. van der Meyden. Knowledge-based programs: On the complexity of perfect recall in finite environments. In Proc. Conf. on Theoretical Aspects of Rationality and Knowledge, pages 31-50, 1996.
24. R. van der Meyden. Common knowledge and update in finite environments. Information and Computation, 140(2):115-157, 1998. A preliminary version of this paper appears in Proc. Conf on Theoretical Aspects of Reasoning about Knowledge, 1994.
25. R. van der Meyden. Common knowledge and update in finite environments. Information and Computation, 140(2):115-157, 1998. A preliminary version of this paper appears in Proc. Conf on Theoretical Aspects of Reasoning about Knowledge, 1994.
26. R. van der Meyden and N. Shilov. Model checking knowledge and time in systems with perfect recall. In Proc. Conf. on Software Technology and Theoretical Computer Science, Springer LNCS No 1738, pages 262-273, Berlin, 1999.
27. J. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols using murphi. In IEEE Symp. on Security and Privacy, pages 141-153, 1997.
28. A. Rao and M. Georgeff. A model theoretic approach to the verification of situated reasoning systems. In Proc. 13th International Joint Conference on Artificial Intelligence, pages 318-324, 1993.
29. S. Schneider and A. Sidiropolous. Csp and anonymity. In E. B. et al, editor, Computer Security - ESORICS 96, 4th European Symposium on Research in Computer Security, Rome, Italy, September 25-27, 1996, Proceedings, volume 1146 of Lecture Notes in Computer Science, pages 198-218. Springer, 1996.
30. V. Shmatikov. Probabilistic analysis of anonymity. In Proc. 15th IEEE Computer Security Foundations Workshop, 2002.
31. P. Syverson and S. Stubblebine. Group principals and the formalization of anonymity. In FM'99 Formal Methods, volume No. 1708, Vol I of Springer LNCS, pages 314-333, 1999.
32. P. Wolper. Expressing interesting properties of programs in prepositional temporal logic. In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 184-192, St. Petersburgh, January 1986.