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

Anish Mathuria. Comparing lower bounds on messages and rounds for two classes of key establishment protocols. Computer Communication Review, 28(5):91-98, 1998. [doi]

Abstract

Abstract is missing.