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]

@article{Mathuria98,
  title = {Comparing lower bounds on messages and rounds for two classes of key establishment protocols},
  author = {Anish Mathuria},
  year = {1998},
  doi = {10.1145/303297.303314},
  url = {http://doi.acm.org/10.1145/303297.303314},
  tags = {protocol},
  researchr = {https://researchr.org/publication/Mathuria98},
  cites = {0},
  citedby = {0},
  journal = {Computer Communication Review},
  volume = {28},
  number = {5},
  pages = {91-98},
}