By Topic

Analysis of cryptographic protocol using Strand Spaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The degree to which a cryptographic protocol is susceptible to successful attacks or penetrations cannot be accurately calculated because of the more fine and fast algorithms to break ciphers, being introduced. To deal with the issue, analysis of a cryptographic protocol becomes more vital; and more exhaustive search for vulnerabilities is required. Kerberos is a widely used security protocol for authentication of the communicating parties. It is usually thought to be the most secure protocol. In this paper, it is shown that a man in the middle attack is possible against Kerberos protocol. This is done using the Strand Spaces, where a series of attacks are carried to verify the authenticity of participants in the Kerberos protocol using formal methods. To make the paper self-contained we also provide a solution on how to solve the problem.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:8 )

Date of Conference:

9-11 July 2010