An efficient two-party identity-based key exchange protocol

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.

Original languageEnglish
Pages (from-to)125-136
Number of pages12
JournalInformatica
Volume18
Issue number1
Publication statusPublished - 2007 Mar 26

Fingerprint

Key Exchange
Identity-based
Communication
Discrete Logarithm Problem
Authentication
Costs
Authenticated Key Exchange
Key Agreement
Computing
Data Communication
Computational Cost
Attribute

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Applied Mathematics

Cite this

@article{cead01677d2a45faae39b4702916dd6d,
title = "An efficient two-party identity-based key exchange protocol",
abstract = "A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.",
author = "Yuh-Min Tseng",
year = "2007",
month = "3",
day = "26",
language = "English",
volume = "18",
pages = "125--136",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "1",

}

An efficient two-party identity-based key exchange protocol. / Tseng, Yuh-Min.

In: Informatica, Vol. 18, No. 1, 26.03.2007, p. 125-136.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient two-party identity-based key exchange protocol

AU - Tseng, Yuh-Min

PY - 2007/3/26

Y1 - 2007/3/26

N2 - A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.

AB - A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.

UR - http://www.scopus.com/inward/record.url?scp=33947405259&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947405259&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33947405259

VL - 18

SP - 125

EP - 136

JO - Informatica

JF - Informatica

SN - 0868-4952

IS - 1

ER -