References

  1. M. Abadi & A. D. Gordon (1999): A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation 148(1), pp. 1–70, doi:10.1006/inco.1998.2740.
  2. M. Abadi & P. Rogaway (2002): Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption). Journal of Cryptology 15(2), pp. 103–127, doi:10.1007/s00145-007-0203-0.
  3. M. Abadi & M. R. Tuttle (1991): A Semantics for a Logic of Authentication. In: Proc. 10th ACM Symposium on Principles of Distributed Computing, pp. 201–216, doi:10.1145/112600.112618.
  4. R. Accorsi, D. Basin & L. Viganò (2001): Towards an awareness-based semantics for security protocol analysis. In: Jean Goubault-Larrecq: Proc. Workshop on Logical Aspects of Cryptographic Protocol Verification, Electronic Notes in Theoretical Computer Science 55.1. Elsevier Science Publishers, pp. 5–24, doi:10.1016/S1571-0661(04)00242-7.
  5. M. Backes, B. Pfitzmann & M. Waidner (2003): A Composable Cryptographic Library with Nested Operations. In: Proc. 10th ACM Conference on Computer and Communications Security (CCS'03). ACM Press, pp. 220–230, doi:10.1145/948109.948140.
  6. M. Bellare & P. Rogaway (1993): Entity Authentication and Key Distribution. In: Proc. 13th Annual International Cryptology Conference (CRYPTO'93), Lecture Notes in Computer Science 773. Springer-Verlag, pp. 232–249, doi:10.1007/3-540-48329-2_21.
  7. P. Bieber (1990): A Logic of Communication in Hostile Environment. In: Proc. 3rd IEEE Computer Security Foundations Workshop (CSFW'90). IEEE Computer Society Press, pp. 14–22, doi:10.1109/CSFW.1990.128181.
  8. B. Blanchet (2008): A Computationally Sound Mechanized Prover for Security Protocols. IEEE Transactions on Dependable and Secure Computing 5(4), pp. 193–207, doi:10.1109/TDSC.2007.1005.
  9. I. Boureanu, M. Cohen & A. Lomuscio (2009): Automatic verification of temporal-epistemic properties of cryptographic protocols. Journal of Applied Non-Classical Logics 19(4), pp. 463–487, doi:10.3166/jancl.19.463-487.
  10. M. Burrows, M. Abadi & R. Needham (1990): A Logic of Authentication. ACM Transactions on Computer Systems 8(1), pp. 18–36, doi:10.1145/77648.77649.
  11. M. Burrows, M. Abadi & R. M. Needham (1990): Rejoinder to Nessett. ACM Operating Systems Review 24(2), pp. 39–40, doi:10.1145/382258.382790.
  12. R. Canetti, O. Goldreich & S. Halevi (2004): The random oracle methodology, revisited. J. ACM 51(4), pp. 557–594, doi:10.1145/1008731.1008734.
  13. I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell & A. Scedrov (1999): A Meta-Notation for Protocol Analysis. In: Proc. 12th IEEE Computer Security Foundations Workshop (CSFW'99). IEEE Computer Society Press, pp. 55–69, doi:10.1109/CSFW.1999.779762.
  14. M. Cohen (2007): Logics of Knowledge and Cryptography: Completeness and Expressiveness. KTH.
  15. M. Cohen & M. Dam (2005): Logical Omniscience in the Semantics of BAN Logic. In: Proc. Workshop on Foundations of Computer Security (FCS'05).
  16. M. Cohen & M. Dam (2007): A complete axiomatization of knowledge and cryptography. In: Proc. 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07), doi:10.1109/LICS.2007.4.
  17. A. Datta, A. Derek, J. C. Mitchell, V. Shmatikov & M. Turuani (2005): Probabilistic Polynomial-Time Semantics for a Protocol Security Logic. In: Proc. 32nd Colloquium on Automata, Languages, and Programming (ICALP'05), pp. 16–29, doi:10.1007/11523468_2.
  18. F. Dechesne & Y. Wang (2010): To know or not to know: epistemic approaches to security protocol verification. Synthese 177(1), pp. 51–76, doi:10.1007/s11229-010-9765-8.
  19. R. Fagin, J. Y. Halpern, Y. Moses & M. Y. Vardi (1995): Reasoning about Knowledge. MIT Press.
  20. P. Gammie & R. van der Meyden (2004): MCK: Model Checking the Logic of Knowledge. In: Proc. 16th International Conference on Computer Aided Verification (CAV'04), Lecture Notes in Computer Science. Springer-Verlag, pp. 479–483, doi:10.1007/978-3-540-27813-9_41.
  21. O. Goldreich (2001): Foundations of Cryptography: Volume 1, Basic Techniques. Cambridge University Press, doi:10.1017/CBO9780511546891.
  22. O. Goldreich, S. Goldwasser & Silvio Micali (1986): How to construct random functions. J. ACM 33(4), pp. 792–807, doi:10.1145/6490.6503.
  23. L. Gong, R. Needham & R. Yahalom (1990): Reasoning about Belief in Cryptographic Protocols. In: Proc. 1990 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, pp. 234–248, doi:10.1109/RISP.1990.63854.
  24. J. D. Guttman (2002): Security protocol design via authentication tests. In: Proc. 15th IEEE Computer Security Foundations Workshop (CSFW'02). IEEE Computer Society Press, pp. 92–103, doi:10.1109/RISP.1990.63854.
  25. J. Y. Halpern & Y. Moses (1990): Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), pp. 549–587, doi:10.1145/79147.79161.
  26. J. Y. Halpern & R. Pucella (2002): Modeling adversaries in a logic for reasoning about security protocols. In: Proc. Workshop on Formal Aspects of Security (FASec'02), Lecture Notes in Computer Science 2629, pp. 115–132, doi:10.1145/79147.79161.
  27. J. Y. Halpern & M. R. Tuttle (1993): Knowledge, probability, and adversaries. Journal of the ACM 40(4), pp. 917–962, doi:10.1145/153724.153770.
  28. J. Hintikka (1962): Knowledge and Belief. Cornell University Press.
  29. X. Huang, C. Luo & R. van der Meyden (2011): Symbolic model checking of probabilistic knowledge. In: Proc. Conf. on Theoretical Aspects of Rationality and Knowledge (TARK-2011), pp. 177–186, doi:10.1145/2000378.2000399.
  30. D. Kindred & J. M. Wing (1997): Closing the idealization gap with theory generation. In: DIMACS Workshop on Design and Formal Verification of Security Protocols.
  31. A. Lomuscio, H. Qu & F. Raimondi (2017): MCMAS: an open-source model checker for the verification of multi-agent systems. STTT 19(1), pp. 9–30, doi:10.1007/s10009-015-0378-x.
  32. G. Lowe (1998): Casper: A Compiler for the Analysis of Security Protocols. Journal of Computer Security 6, pp. 53–84, doi:10.3233/JCS-1998-61-204.
  33. G. Lowe (2004): Analysing protocols subject to guessing attacks. Journal of Computer Security 12(1), pp. 83–97, doi:10.3233/JCS-2004-12104.
  34. W. Mao (1995): An augmentation of BAN-like logics. In: Proc. 8th IEEE Computer Security Foundations Workshop (CSFW'95). IEEE Computer Society Press, pp. 44–56, doi:10.1109/CSFW.1995.518552.
  35. R. van der Meyden & K. Su (2004): Symbolic Model Checking the Knowledge of the Dining Cryptographers. In: Proc. 17th IEEE Computer Security Foundations Workshop (CSFW'04). IEEE Computer Society Press, pp. 280–291, doi:10.1109/CSFW.2004.1310747.
  36. D. Micciancio & B. Warinschi (2004): Soundness of Formal Encryption in the Presence of Active Adversaries. In: Proc. Theory of Cryptography Conference (TCC'04), Lecture Notes in Computer Science 2951. Springer-Verlag, pp. 133–151, doi:10.1007/978-3-540-24638-1_8.
  37. J. Mitchell, M. Mitchell & U. Stern (1997): Automated analysis of cryptographic protocols using Murφ. In: Proc. 1997 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, pp. 141–151, doi:10.1109/SECPRI.1997.601329.
  38. Y. Moses & Y. Shoham (1993): Belief as defeasible knowledge. Artificial Intelligence 64(2), pp. 299–322, doi:10.1016/0004-3702(93)90107-M.
  39. D. M. Nessett (1990): A Critique of the Burrows, Abadi and Needham Logic. ACM Operating Systems Review 24(2), pp. 35–38, doi:10.1145/382258.382789.
  40. B. C. Neuman & S. Stubblebine (1993): A Note on the Use of Timestamps as Nonces. ACM Operating Systems Review 27(2), pp. 10–14, doi:10.1145/155848.155852.
  41. L. C. Paulson (1998): The Inductive Approach to Verifying Cryptographic Protocols. Journal of Computer Security 6(1/2), pp. 85–128, doi:10.3233/JCS-1998-61-205.
  42. R. Pucella (2015): Knowledge and Security. In: H. van Ditmarsch, J. Y. Halpern, W. van der Hoek & B. Kooi: Handbook of Epistemic Logic. College Publications, pp. 591–655.
  43. S. Stubblebine & R. Wright (1996): An authentication logic supporting synchronization, revocation, and recency. In: Proc. 3rd ACM Conference on Computer and Communications Security (CCS'96). ACM Press, pp. 95–105, doi:10.1145/238168.238195.
  44. P. F. Syverson & P. C. van Oorschot (1994): On Unifying Some Cryptographic Protocol Logics. In: Proc. 1994 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, pp. 14–28, doi:10.1109/RISP.1994.296595.
  45. F. J. Thayer, J. C. Herzog & J. D. Guttman (1999): Strand Spaces: Proving Security Protocols Correct. Journal of Computer Security 7(2/3), pp. 191–230, doi:10.3233/JCS-1999-72-304.
  46. B. Toninho & L. Caires (2010): A Spatial-Epistemic Logic for Reasoning about Security Protocols. In: Proc. 8th International Workshop on Security Issues in Concurrency, pp. 1–15, doi:10.4204/EPTCS.51.1.
  47. H. Van Ditmarsch, J. Van Eijck, I. Hernández-Antón, F. Sietsma, S. Simon & F. Soler-Toscano (2012): Modelling cryptographic keys in dynamic epistemic logic with demo. In: J. Bajo Pérez, M. A. Sánchez, P. Mathieu, J. M. Corchado Rodríguez, E. Adam, A. Ortega, M. N. Moreno García, E. Navarro, B. Hirsch, H. L. Cardoso & V. Julián: Highlights on Practical Applications of Agents and Multi-Agent Systems. Springer, pp. 155–162, doi:10.1007/978-3-642-28762-6_19.
  48. G. Wedel & V. Kessler (1996): Formal Semantics for Authentication Logics. In: Proc. 4th European Symposium on Research in Computer Security (ESORICS'96), Lecture Notes in Computer Science 1146. Springer-Verlag, pp. 219–241, doi:10.1007/3-540-61770-1_39.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org