Kerberos Version IV: Inductive analysis of the secrecy goals-Reference-Cited by-同舟云学术

Kerberos Version IV: Inductive analysis of the secrecy goals

Published:1998 Issue: Volume: Page:361-375
ISSN:0302-9743
Container-title:Computer Security — ESORICS 98
language:
Short-container-title:

Author:

Bella Giampaolo,Paulson Lawrence C.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055875

Reference20 articles.

1. G. Bella, L. C. Paulson. Using Isabelle to Prove Properties of the Kerberos Authentication System. Proc. of DIMACS Workshop on Design and Formal Verification of Security Protocols, Orman and Meadows (eds.), 1997.

2. G. Bella, L. C. Paulson. Mechanising BAN Kerberos by the Inductive Method. Proc. of Conference on Computer Aided Verification, Springer, LNCS Series, 1998.

3. G. Bella, E. Riccobene. Formal Analysis of the Kerberos Authentication System. Journal of Universal Computer Science: Special Issue on Gurevich’s Abstract State Machine, Springer, 1997.

4. S. M. Bellovin, M. Meritt. Limitations of the Kerberos authentication system. Computer Comm. Review, 20(5) 119–132, 1990.

5. S. H. Brackin. A HOL Extension of GNY for Automatically Analyzing Cryptographic Protocols. Proc. of Computer Security Foundations Workshop, IEEE Press, 1996.

Cited by 65 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice;ACM Computing Surveys;2022-12-07

2. Kerberos;Guide to Internet Cryptography;2022

3. Resource and timing aspects of security protocols;Journal of Computer Security;2021-05-07

4. Symbolic Timed Trace Equivalence;Foundations of Security, Protocols, and Equational Reasoning;2019

5. A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols;Foundations of Security, Protocols, and Equational Reasoning;2019