Abstract | ||
---|---|---|
Authentication protocols are the basis of security in many distributed systems, and it is therefore essential to ensure that these protocols function correctly. Unfortunately, their design has been extremely error prone. Most of the protocols found in the literature contain redundancies or security flaws.A simple logic has allowed us to describe the beliefs of trustworthy parties involved in authentication protocols and the evolution of these beliefs as a consequence of communication. We have been able to explain a variety of authentication protocols formally, to discover subtleties and errors in them, and to suggest improvements. In this paper, we present the logic and then give the results of our analysis of four published protocols, chosen either because of their practical importance or because they serve to illustrate our method. |
Year | DOI | Venue |
---|---|---|
1989 | 10.1145/77648.77649 | ACM Transactions on Computer Systems (TOCS) |
Keywords | DocType | Volume |
simple logic,security flaw,authentication protocol,general terms: security,trustworthy party,practical importance,x.509,verification additional key words and phrases: authentication protocols,needham-schroeder,key distribution protocols,theory,cryptographic protocol,logics of knowledge and belief,key distribution,distributed system | Conference | 8 |
Issue | ISSN | ISBN |
1 | 0734-2071 | 0-89791-338-8 |
Citations | PageRank | References |
1192 | 205.60 | 20 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Michael Burrows | 1 | 5117 | 883.48 |
Martín Abadi | 2 | 12074 | 1324.31 |
Roger M. Needham | 3 | 4648 | 2075.99 |