Name
Abstract | ||
|---|---|---|
The theory of authentication tests is a powerful tool for analyzing and designing cryptographic protocols. However, it is difficult to apply the theory directly to prove the security goals of the protocols because determining the type of the test (e.g. outgoing, incoming and unsolicited test) is a little complex for computer and deriving the security properties of a test needs more intelligence. Therefore, automatic security protocol analyzer cannot be implemented efficiently based on this theory. To solve this problem, in this paper we propose an authentication test type matrix (ATTM), which makes the identification of the test type very simple and straightforward. Furthermore, we propose and prove a set of security properties associated with each case indicated by the elements in the ATTM, which can be used directly in protocol analysis and design. Using the example of Needham-Schroeder protocol, we demonstrate that ATTM makes automatic security protocol verification and design much easier and more straightforward. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICC.2009.5198770 | ICC |
Keywords | Field | DocType |
authentication,information security,protocols,cryptographic protocol,computer security,system testing,cryptography,data mining,symmetric matrices,cryptographic protocols,protocol analysis,security protocol,testing | Authentication,Protocol analysis,Cryptographic protocol,Computer science,Cryptography,System testing,Information security,Computer network,Theoretical computer science,Symmetric matrix,Computer engineering,Needham–Schroeder protocol | Conference |
Volume | Issue | ISSN |
null | null | 1550-3607 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aixin Zhang | 1 | 8 | 6.94 |
| Junhua Tang | 2 | 63 | 12.59 |
| Peng Wang | 3 | 0 | 0.34 |