Comparing lower bounds on messages and rounds for two classes of key establishment protocols
Anish Mathuria · ACM SIGCOMM Computer Communication Review · 1998
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.