Abstract
A conference-key establishment protocol allows participants to construct a common session key that is used to encrypt/decrypt transmitted messages among the participants over an open channel. There are two kinds of conference-key establishment protocols: conference-key distribution and conference-key agreement. In a conference-key distribution protocol, a trusted or elected entity is responsible for generating and distributing the conference key. A conference-key agreement protocol involves all participants cooperatively establishing a conference key. This article designs a secure conference-key agreement protocol with constant round number and message size. Under the decision Diffie-Hellman problem assumption, the resulting protocol is demonstrated to be secure against passive adversaries. Under the random oracle model, the proposed protocol is demonstrated to be provable secure against impersonator attacks and withstand known-key attacks. Compared to previously proposed protocols with round-efficiency, the proposed protocol requires a constant message size for each participant. Furthermore, the proposed protocol possesses both fault tolerance and forward secrecy, while previously proposed protocols with round-efficiency lack one or both properties.
| Original language | English |
|---|---|
| Pages (from-to) | 1091-1101 |
| Number of pages | 11 |
| Journal | Journal of Systems and Software |
| Volume | 80 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 2007 Jul 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Information Systems
- Software
Cite this
}
A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy. / Tseng, Yuh-Min.
In: Journal of Systems and Software, Vol. 80, No. 7, 01.07.2007, p. 1091-1101.Research output: Contribution to journal › Article
TY - JOUR
T1 - A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy
AU - Tseng, Yuh-Min
PY - 2007/7/1
Y1 - 2007/7/1
N2 - A conference-key establishment protocol allows participants to construct a common session key that is used to encrypt/decrypt transmitted messages among the participants over an open channel. There are two kinds of conference-key establishment protocols: conference-key distribution and conference-key agreement. In a conference-key distribution protocol, a trusted or elected entity is responsible for generating and distributing the conference key. A conference-key agreement protocol involves all participants cooperatively establishing a conference key. This article designs a secure conference-key agreement protocol with constant round number and message size. Under the decision Diffie-Hellman problem assumption, the resulting protocol is demonstrated to be secure against passive adversaries. Under the random oracle model, the proposed protocol is demonstrated to be provable secure against impersonator attacks and withstand known-key attacks. Compared to previously proposed protocols with round-efficiency, the proposed protocol requires a constant message size for each participant. Furthermore, the proposed protocol possesses both fault tolerance and forward secrecy, while previously proposed protocols with round-efficiency lack one or both properties.
AB - A conference-key establishment protocol allows participants to construct a common session key that is used to encrypt/decrypt transmitted messages among the participants over an open channel. There are two kinds of conference-key establishment protocols: conference-key distribution and conference-key agreement. In a conference-key distribution protocol, a trusted or elected entity is responsible for generating and distributing the conference key. A conference-key agreement protocol involves all participants cooperatively establishing a conference key. This article designs a secure conference-key agreement protocol with constant round number and message size. Under the decision Diffie-Hellman problem assumption, the resulting protocol is demonstrated to be secure against passive adversaries. Under the random oracle model, the proposed protocol is demonstrated to be provable secure against impersonator attacks and withstand known-key attacks. Compared to previously proposed protocols with round-efficiency, the proposed protocol requires a constant message size for each participant. Furthermore, the proposed protocol possesses both fault tolerance and forward secrecy, while previously proposed protocols with round-efficiency lack one or both properties.
UR - http://www.scopus.com/inward/record.url?scp=34248526025&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34248526025&partnerID=8YFLogxK
U2 - 10.1016/j.jss.2006.10.053
DO - 10.1016/j.jss.2006.10.053
M3 - Article
AN - SCOPUS:34248526025
VL - 80
SP - 1091
EP - 1101
JO - Journal of Systems and Software
JF - Journal of Systems and Software
SN - 0164-1212
IS - 7
ER -