Abstract
A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an untrusted, open network by allowing them to agree on a common secret key. In the past decade many problems related to group key agreement have been tackled and solved (diminished if not solved), and recently some constant-round protocols have been proven secure in concrete, realistic setting. However, all forward-secure protocols so far are still too expensive for small mobile devices. In this paper we propose a new constant-round protocol well suited for a mobile environment and prove its security under the decisional Diffie-Hellman assumption. The protocol meets simplicity, efficiency, and all the desired security properties.
| Original language | English |
|---|---|
| Pages (from-to) | 73-83 |
| Number of pages | 11 |
| Journal | Journal of Systems and Software |
| Volume | 78 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2005 Oct 1 |
| Externally published | Yes |
Fingerprint
Keywords
- DDH assumption
- Group key agreement
- Mobile device
- Multicast
ASJC Scopus subject areas
- Computer Science Applications
- Information Systems
- Software
Cite this
DDH-based group key agreement in a mobile environment. / Nam, Junghyun; Lee, Jinwoo; Kim, Seung-Joo; Won, Dongho.
In: Journal of Systems and Software, Vol. 78, No. 1, 01.10.2005, p. 73-83.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - DDH-based group key agreement in a mobile environment
AU - Nam, Junghyun
AU - Lee, Jinwoo
AU - Kim, Seung-Joo
AU - Won, Dongho
PY - 2005/10/1
Y1 - 2005/10/1
N2 - A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an untrusted, open network by allowing them to agree on a common secret key. In the past decade many problems related to group key agreement have been tackled and solved (diminished if not solved), and recently some constant-round protocols have been proven secure in concrete, realistic setting. However, all forward-secure protocols so far are still too expensive for small mobile devices. In this paper we propose a new constant-round protocol well suited for a mobile environment and prove its security under the decisional Diffie-Hellman assumption. The protocol meets simplicity, efficiency, and all the desired security properties.
AB - A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an untrusted, open network by allowing them to agree on a common secret key. In the past decade many problems related to group key agreement have been tackled and solved (diminished if not solved), and recently some constant-round protocols have been proven secure in concrete, realistic setting. However, all forward-secure protocols so far are still too expensive for small mobile devices. In this paper we propose a new constant-round protocol well suited for a mobile environment and prove its security under the decisional Diffie-Hellman assumption. The protocol meets simplicity, efficiency, and all the desired security properties.
KW - DDH assumption
KW - Group key agreement
KW - Mobile device
KW - Multicast
UR - http://www.scopus.com/inward/record.url?scp=19744369256&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=19744369256&partnerID=8YFLogxK
U2 - 10.1016/j.jss.2004.10.024
DO - 10.1016/j.jss.2004.10.024
M3 - Article
AN - SCOPUS:19744369256
VL - 78
SP - 73
EP - 83
JO - Journal of Systems and Software
JF - Journal of Systems and Software
SN - 0164-1212
IS - 1
ER -