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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.