Abstract
The confidentiality of encrypted data depends on how well the key under which it was encrypted is maintained. If a session key was exchanged encrypted under a long-term key, exposure of the long-term key may reveal the session key and hence the data encrypted with it. The problem of key-dependencies between keys can be mapped onto connectivity of a graph, and the resulting graph can be inspected. This article presents a structured method (an algorithm) with which key-dependencies can be detected and analysed. Several well-known protocols are examined, and it is shown that they are vulnerable to certain attacks exploiting key-dependencies. Protocols which are free from this defect do exist. That is, when a session is terminated it is properly closed.
| Original language | English |
|---|---|
| Title of host publication | Information Security and Privacy |
| Subtitle of host publication | Third Australasian Conference, ACISP'98, Brisbane, Australia July 13-15, 1998, Proceedings |
| Editors | Colin Boyd, Ed Dawson |
| Place of Publication | Berlin, Heidelberg |
| Publisher | Springer |
| Pages | 356-366 |
| Number of pages | 11 |
| ISBN (Electronic) | 978-3-540-69101-3 |
| ISBN (Print) | 978-3-540-64732-4 |
| DOIs | |
| Publication status | Published - Jul 1998 |
| Event | 3rd Australasian Conference on Information Security and Privacy, ACISP 1998 - Brisbane, Australia Duration: 13 Jul 1998 → 15 Jul 1998 Conference number: 3 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 1438 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 3rd Australasian Conference on Information Security and Privacy, ACISP 1998 |
|---|---|
| Abbreviated title | ACISP |
| Country/Territory | Australia |
| City | Brisbane |
| Period | 13/07/98 → 15/07/98 |