Paper 2005/064

On Efficient Key Agreement Protocols

Anish Mathuria and Vipul Jain

Abstract

A class of efficient key agreement protocols proposed by Boyd is examined. An attack is demonstrated on a round-optimal example protocol of this class, and a simple countermeasure is suggested. The whole class is known to be vulnerable to an attack proposed by Bauer, Berson and Feiertag. A new class of key agreement protocols without this vulnerability but having the same advantages in efficiency is identified, and a number of concrete protocols are suggested.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
key management
Contact author(s)
anish_mathuria @ da-iict org
History
2005-03-01: received
Short URL
https://ia.cr/2005/064
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/064,
      author = {Anish Mathuria and Vipul Jain},
      title = {On Efficient Key Agreement Protocols},
      howpublished = {Cryptology ePrint Archive, Paper 2005/064},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/064}},
      url = {https://eprint.iacr.org/2005/064}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.