A note on the use of timestamps as nonces
ACM SIGOPS Operating Systems Review
Strand spaces: proving security protocols correct
Journal of Computer Security
Authentication tests and the structure of bundles
Theoretical Computer Science
An attack-finding algorithm for security protocols
Journal of Computer Science and Technology
SG Logic- A Formal Analysis Technique for Authentication Protocols
Proceedings of the 5th International Workshop on Security Protocols
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Study on strand space model theory
Journal of Computer Science and Technology
Authentication tests and disjoint encryption: A design method for security protocols
Journal of Computer Security - Special issue on CSFW15
Two attacks on Neuman-Stubblebine authentication protocols
Information Processing Letters
Authentication tests based on test type matrix
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 0.01 |
This paper proposes the improved authentication tests in order to find the potential attacks on security protocols. It is based on the authentication tests theory and enhances the original methods by introducing the notion of message type. Formalized definition of replay attacks have been integrated into the original theoretical models for further verification of security protocols. The thoroughly proof of initial and subsequent authentications in Neuman-Stubblebine protocol shows that the improved authentication tests can find flaws of the protocol more efficiently than the original ones.