A complete axiomatization of knowledge and cryptography

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 77-86

  Cohen, Mika ^a   Dam, Mads ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATIZATION; COMPLETE AXIOMATIZATIONS; COMPUTATIONAL SOUNDNESS; ELECTRONIC PAYMENT; EPISTEMIC LOGIC; FIRST-ORDER; KRIPKE SEMANTICS; PI CALCULUS; SECURITY PROTOCOL VERIFICATION; SECURITY PROTOCOLS; STATIC EQUIVALENCE;

CALCULATIONS; CRYPTOGRAPHY; NETWORK SECURITY; SEMANTICS;

COMPUTATION THEORY;

EID: 78650511607     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.4     Document Type: Conference Paper

References (33)

1. M. Abadi, M. Baudet, and B. Warinschi. Guessing attacks and the computational soundness of static equivalence. In FoSSaCS'06, pages 398-412, 2006. (Pubitemid 44019354)
2. M. Abadi and V. Cortier. Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci., 367(1-2):2-32, 2006. (Pubitemid 44649345)
3. M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. Nordic J. of Computing, 5(4), 1998.
4. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology, 15(2):103-127, 2002.
5. M. Abadi and M. Tuttle. A semantics for a logic of authentication. In PODC'91, pages 201-216, 1991.
6. R. Accorsi, D. A. Basin, and L. Viganò. Towards an awareness-based semantics for security protocol analysis. Electr. Notes Theor. Comput. Sci., 55(1), 2001.
7. N. Agray, W. van der Hoek, and E. P. de Vink. On BAN logics for industrial security protocols. In Proc. CEEMAS, pages 29-36, 2001.
8. P. Bieber. A logic of communication in hostile environments. In CSFW III, pages 14-22. IEEE Computer Society Press, 1990.
9. T. Brauner and S. Ghilardi. First-order modal logic. In F. W. Patrick Blackburn, Johan van Benthem, editor, Handbook of Modal Logic: Volume III. Elsevier, 2006.
10. M. Burrows, M. Abadi, and R. M. Needham. A logic of authentication. ACM Trans. Comput. Syst., 8(1):18-36, 1990.
11. D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24(2):84-90, 1981.
12. M. Cohen and M. Dam. A completeness result for BAN logic. In Proc. M4M'05, pages 202-219, 2005.
13. M. Cohen and M. Dam. Logical omniscience in the semantics of BAN logic. In Proc. FCS'05, pages 121-132, 2005.
14. M. Cohen and M. Dam. A complete axiomatization of knowledge and cryptography. Research report TRITA-CSC-TCS-2007:1, KTH CSC, 2007. http://web.it.kth.se/~mfd/TRITACSCTCS1.pdf.
15. N. Durgin, J. Mitchell, and D. Pavlovic. A compositional logic for proving security properties of protocols. J. Comput. Secur., 11(4):677-721, 2004.
16. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y Vardi. Reasoning About Knowledge. MIT Press, 1995.
17. C. Fournet and M. Abadi. Mobile values, new names, and secure communication. In Proc. POPL'01, pages 104-115, 2001.
18. D. Gabbay, V. Shehtman, and D. Skvortsov. Quantification in nonclassical logic. 2006. Manuscript.
19. J. W. Garson. Quantification in modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic: Volume II. Reidel, 1984.
20. O. Goldreich. Foundations of Cryptography, volume Basic Tools. Cambridge University Press, 2001.
21. J. Halpern and K. O'Neill. Anonymity and information hiding in multiagent systems. In Proc. CSFW'03, pages 75-88, 2003.
22. J. Y Halpern and R. Pucella. Modeling adversaries in a logic for security protocol analysis. In Proc. FASec, pages 115-132, 2002.
23. S. Kramer. Logical concepts in cryptography. Cryptology ePrint Archive, Report 2006/262, 2006.
24. D. Lewis. Counterpart theory and quantified modal logic. Journal of Philosophy, 65:113-126, 1968.
25. A. Lomuscio and B. Wozna. A combination of explicit and deductive knowledge with branching time: Completeness and decidability results. In DALT, pages 188-204, 2005. (Pubitemid 44013064)
26. Mastercard and VISA. SET Secure Electronic Transaction Specification. 1997.
27. R. Parikh and R. Ramanujam. Distributed processes and the logic of knowledge. In Logic of Programs, pages 256-268, 1985.
28. R. Pucella. Reasoning about Resource-Bounded Knowledge: Theory and Application to Security Protocol Analysis. Ph.D. Thesis, Cornell University, 2004.
29. M. K. Reiter and A. D. Rubin. Crowds: anonymity for web transactions. ACM Trans. Inf. Syst. Secur, 1(1), 1998.
30. K. S. Ron van der Meyden. Symbolic model checking the knowledge of the dining cryptographers. In Proc. CSFW'04, 2004.
31. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, Jan. 2003.
32. P. F. Syverson and P. C. van Oorschot. A unified cryptographic protocol logic. NRL Publication 5540-227, Naval Research Lab, 1996.
33. M.-J. Toussaint and P. Wolper. Reasoning about cryptographic protocols. In J. Feigenbaum and M. Merritt, editors, Distributed Computing and Cryptography, pages 245-262. 1989.