ACM Transactions on Computer Systems (TOCS)
A semantics for a logic of authentication (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Using CSP to Detect Errors in the TMN Protocol
IEEE Transactions on Software Engineering
Using encryption for authentication in large networks of computers
Communications of the ACM
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
ACM SIGOPS Operating Systems Review
Using SMV for cryptographic protocol analysis: a case study
ACM SIGOPS Operating Systems Review
Study on strand space model theory
Journal of Computer Science and Technology
An approach to the formal verification of the three-principal cryptographic protocols
ACM SIGOPS Operating Systems Review
Running-mode analysis of the Security Socket Layer protocol
ACM SIGOPS Operating Systems Review
An efficient dynamic group key agreement protocol for imbalanced wireless networks
International Journal of Network Management
The running-mode analysis of two-party optimistic fair exchange protocols
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Hi-index | 0.00 |
A general method, which can be used to verify the two-party cryptographic protocols, is present in this paper. Our approach makes use of running modes of the two-party cryptographic protocols to analyze the protocols. Based on this method, the verification of the protocols becomes independent of model checking tools. Finally, this approach is illustrated with an example on the Needham-Schroeder public-key protocol.