Comparing lower bounds on messages and rounds for two classes of key establishment protocols

Authors:
Anish Mathuria
Affiliations:
OBM Tokyo Research Laboratory, Kanagawa-ken, Japan
Venue:
ACM SIGCOMM Computer Communication Review
Year:
1998

Citing 6
Cited 0

Lower bounds on messages and rounds for network authentication protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Using encryption for authentication in large networks of computers

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Towards a classification of key agreement protocols

CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
A Class of Flexible and Efficient Key Management Protocols

CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Efficient network authentication protocols: lower bounds and optimal implementations

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important requirement in designing protocols for key establishment is to provide assurance to protocol participants that a session key is fresh. This paper compares lower bounds on messages and rounds for two classes of protocols based on fundamentally different methods for achieving session key freshness.