Using backward strategy to the Needham-Schroeder public key protocol verification

Authors:
Mirosław Kurkowski;Witold Mac´ków
Affiliations:
Institut of Mathematics & Computer Science, Pedagogical University of Czestochowa, al. Armii Krajowej 13/15, 42-200 Czestochowa, Poland;Faculty of Computer Science & Information Systems, Department of Programming Techniques, Technical University of Szczecin, 49, Zolnierska st., 71-210 Szczecin, Poland
Venue:
Artificial intelligence and security in computing systems
Year:
2003

Citing 7
Cited 0

An attack on the Needham-Schroeder public-key authentication protocol

Information Processing Letters
Timestamps in key distribution protocols

Communications of the ACM
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
Language generation and verification in the NRL protocol analyzer

CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Casper: A Compiler for the Analysis of Security Protocols

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

When dealing with secure distributed systems it is essential that entities (principals, persons, hosts, computers, etc.) are able to prove their identities to each other. The process of proving the identity is called entity authentication. Cryptographic protocols are very good tools to achieve this goal. These protocols are precisely defined sequences of communication and computation steps that use some mechanism such as encryption and decryption. In this paper we present applying a new fast method of verification of cryptographic authentication protocols to verification of the Needham-Schroeder Public Key Authentication Protocol. We present a verification algorithm, its implementation and some experimental results. Our method is a kind of model checking. To decrease the number of states in the space, which describe executions of authentication protocols in real net, we use a partial order reduction. For the verification of correctness property we apply a backward induction method.