ISSN:
1432-0452
Keywords:
Key words: Authentication
;
Key distribution
;
Protocol metrics
;
Lower bound
;
Optimal protocol
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Summary. Research in authentication protocols has focused largely 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, rounds, and encryptions 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. Moreover, we give impossibility results of obtaining protocols that are simultaneously optimal with respect to the numbers of messages and rounds.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s004460050015
Permalink
