Verifying epistemic protocols under common knowledge

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09

Volumn , Issue , 2009, Pages 257-266

  Wang, Yanjing ^a   Kuppusamy, Lakshmanan ^a   Eijck, Jan Van ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON KNOWLEDGE; COMMUNICATION PROTOCOLS; COORDINATED ATTACK; DETERMINISTIC PROTOCOLS; FORMAL ANALYSIS; MODEL CHECKING PROBLEM; PROTOCOL DESCRIPTION; PROTOCOL LANGUAGES; SECRET KEY;

COMMUNICATION; COMPUTABILITY AND DECIDABILITY; CRYPTOGRAPHY;

MODEL CHECKING;

EID: 70350627206     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1562814.1562848     Document Type: Conference Paper

References (19)

1. T. Agotnes, P. Balbiani, H. van Ditmarsch, and P. Seban.Group announcement logic. 2008.
2. M. D. Atkinson, H. van Ditmarsch, and S. Roehling. Avoiding bias in cards cryptography. Australasian Journal of Combinatorics, 44:3-17, February 2009.
3. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society of London, Series A, Mathematical and Physical Sciences, 426(1871):233-271,December 1989.
4. D. Chaum, C. Crépeau, and I. Damgard. Multiparty unconditionally secure protocols. In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing,pages 11-19, New York, NY, USA, 1988. ACM.
5. R. Fagin, J. Y. Halpern, M. Y. Vardi, and Y. Moses. Reasoning about knowledge. MIT Press, Cambridge, MA, USA, 1995.
6. K. Fine. In so many possible worlds. Notre Dame J. Formal Logic, 13(4):516-520, 1972.
7. M. J. Fischer and R. N.Wright. Multiparty secret key exchange using a random deal of cards. In In Proc. CRYPTO, pages 141-155, 1991.
8. M. J. Fischer and R. N. Wright. Bounds on secret key exchange using a random deal of cards. Journal of Cryptology , Springer Verlag, 9:71-99, 1996.
9. G. Gamow and M. Stern. Puzzle-math. Viking Adult, February 1958.
10. D. Jackson. Alloy: a lightweight object modelling notation.ACM Trans. Softw. Eng. Methodol., 11(2):256-290, April 2002.
11. J. Miller and L. Moss. The undecidability of iterated modal relativization. Studia Logica, 79, April 2005.
12. S. Petride and R. Pucella. Perfect cryptography, s5 knowledge, and algorithmic knowledge. In TARK '07: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge, pages 239-247, New York, NY, USA, 2007. ACM.
13. J. van Benthem, J. van Eijck, and B. Kooi. Logics of communication and change. Information and Computation, 204(11):1620-1662, November 2006.
14. H. van Ditmarsch. Descriptions of game actions. J. of Logic, Lang. and Inf., 11(3):349-365, 2002.
15. H. van Ditmarsch. The russian cards problem. Studia Logica, pages 31-62, October 2003.
16. H. van Ditmarsch. Unconditionally secure protocols with card deals, September 2008.
17. H. van Ditmarsch and B. Kooi. Semantic results for ontic and epistemic change. In G. Bonanno, W. van der Hoek, and M. Wooldridge, editors, Logic and the Foundations of Game and Decision Theory (LOFT 7), pages 87-117, October 2008.
18. H. van Ditmarsch, W. van der Hoek, and B. Kooi. Dynamic Epistemic Logic. (Synthese Library). Springer, 1st edition, November 2007.
19. G. van Tilburg. Doe wel en zie niet om (do well and don't look back). Katholieke Illustratie (Catholic Illustrated Journal), 90(32):47, 1956.