Lower Bounds on Messages and Rounds for Network Authentication Protocols (1993)
| Venue: | 1st ACM Conference on Computer and Communications Security |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Gong93lowerbounds,
author = {Li Gong},
title = {Lower Bounds on Messages and Rounds for Network Authentication Protocols},
booktitle = {1st ACM Conference on Computer and Communications Security},
year = {1993},
pages = {26--37},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Research in authentication protocols has largely focused on developing and analyzing protocols that are secure against certain types of attacks. There is little and only scattered discussion on protocol efficiency. This paper presents results on the lower bounds on the numbers of messages and rounds required for network authentication. For each proven lower bound, an authentication protocol achieving the bound is also given, thus proving that the bound is a tight bound if the given optimal protocol is secure. 1 Introduction Authentication is by definition a process to verify one's claim of identity. Since authentication is usually a prelude to further communication and computation, an authentication protocol often arranges that the protocol participants, once their identities are verified, agree upon an encryption key--- a temporary key---for later use (e.g., within a user session). Thus an authentication protocol is sometimes also called a key distribution protocol. Current research...
