An overview of analysis of security standards for authentication in distributed systems.

In this paper, we present our analysis of the leading standards for authentication in distributed systems in order to illustrate the extensibility of a finite proof system initially adopted by [3] but could only be illustrated with Woo and Lam protocol. Our inference rule proved that Kerberos version 5 remains vulnerable in scenarios of an attacker having unlimited communication and computational power especially in a single broadcast network. This vulnerability can aid a masquerade participating in the protocol. We also prove the possibility of a masquerade attack when an intruder participates in the SAML protocol. Though our inference rule, as part of our pre-emptive protocol tool still in early stages of development, may show some analytical difficulties, it has the potential to reveal subtle flaws that may not be detected by rules of the same family.