Multi-party key agreement protocols with cheater identification

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In 2000, Pieprzyk and Li proposed two multi-party key agreement protocols based on secret sharing. The proposed protocols can achieve the following security goals: key freshness, key confidentiality, group authentication and key confirmation. However, this article points out that their protocols have a weakness for practical applications. A dishonest principal may disturb the protocol to fail, but anyone cannot identify the fraudulent principal. Therefore, an efficient cheater identification process is essential for multi-party key agreement protocols. Two improvements on their protocols are respectively proposed to remove this weakness. In our protocols, the extra computation overhead is small and security goals are not impaired.

Original languageEnglish
Pages (from-to)551-559
Number of pages9
JournalApplied Mathematics and Computation
Volume145
Issue number2-3
DOIs
Publication statusPublished - 2003 Dec 25

Fingerprint

Key Agreement Protocol
Authentication
Secret Sharing
Confidentiality

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics

Cite this

@article{c6b72a8537094e71a66d119be40e6bbc,
title = "Multi-party key agreement protocols with cheater identification",
abstract = "In 2000, Pieprzyk and Li proposed two multi-party key agreement protocols based on secret sharing. The proposed protocols can achieve the following security goals: key freshness, key confidentiality, group authentication and key confirmation. However, this article points out that their protocols have a weakness for practical applications. A dishonest principal may disturb the protocol to fail, but anyone cannot identify the fraudulent principal. Therefore, an efficient cheater identification process is essential for multi-party key agreement protocols. Two improvements on their protocols are respectively proposed to remove this weakness. In our protocols, the extra computation overhead is small and security goals are not impaired.",
author = "Yuh-Min Tseng",
year = "2003",
month = "12",
day = "25",
doi = "10.1016/S0096-3003(02)00537-4",
language = "English",
volume = "145",
pages = "551--559",
journal = "Applied Mathematics and Computation",
issn = "0096-3003",
publisher = "Elsevier Inc.",
number = "2-3",

}

Multi-party key agreement protocols with cheater identification. / Tseng, Yuh-Min.

In: Applied Mathematics and Computation, Vol. 145, No. 2-3, 25.12.2003, p. 551-559.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Multi-party key agreement protocols with cheater identification

AU - Tseng, Yuh-Min

PY - 2003/12/25

Y1 - 2003/12/25

N2 - In 2000, Pieprzyk and Li proposed two multi-party key agreement protocols based on secret sharing. The proposed protocols can achieve the following security goals: key freshness, key confidentiality, group authentication and key confirmation. However, this article points out that their protocols have a weakness for practical applications. A dishonest principal may disturb the protocol to fail, but anyone cannot identify the fraudulent principal. Therefore, an efficient cheater identification process is essential for multi-party key agreement protocols. Two improvements on their protocols are respectively proposed to remove this weakness. In our protocols, the extra computation overhead is small and security goals are not impaired.

AB - In 2000, Pieprzyk and Li proposed two multi-party key agreement protocols based on secret sharing. The proposed protocols can achieve the following security goals: key freshness, key confidentiality, group authentication and key confirmation. However, this article points out that their protocols have a weakness for practical applications. A dishonest principal may disturb the protocol to fail, but anyone cannot identify the fraudulent principal. Therefore, an efficient cheater identification process is essential for multi-party key agreement protocols. Two improvements on their protocols are respectively proposed to remove this weakness. In our protocols, the extra computation overhead is small and security goals are not impaired.

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

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

U2 - 10.1016/S0096-3003(02)00537-4

DO - 10.1016/S0096-3003(02)00537-4

M3 - Article

VL - 145

SP - 551

EP - 559

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

IS - 2-3

ER -