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 language | English |
|---|---|
| Pages (from-to) | 551-559 |
| Number of pages | 9 |
| Journal | Applied Mathematics and Computation |
| Volume | 145 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 2003 Dec 25 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics
Cite this
}
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 journal › Article
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
AN - SCOPUS:0041520685
VL - 145
SP - 551
EP - 559
JO - Applied Mathematics and Computation
JF - Applied Mathematics and Computation
SN - 0096-3003
IS - 2-3
ER -