Abstract
This paper considers the problem of authenticated key exchange in a dynamic group in which members join and leave the group in an arbitrary fashion. A group key exchange scheme for such a dynamic group is designed to minimize the cost of the rekeying operations associated with group updates. Although a number of schemes have attempted for many years to address this problem, all provably-secure schemes are inadequate in dealing with a dynamic group where group members are spread across a wide area network; their communication overhead for group rekeying is significant in terms of the number of communication rounds or the number of messages, both of which are recognized as the dominant factors that severely slow down group key exchange over a wide area network. In this paper, we propose an efficient key exchange scheme for this scenario and prove its security against an active adversary under the factoring assumption. The proposed scheme requires only a constant number of rounds while achieving low message complexity.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science |
| Editors | V.S. Sunderam, G.D. Albada, P.M.A. Sloot, J.J. Dongarra |
| Pages | 493-501 |
| Number of pages | 9 |
| Volume | 3515 |
| Edition | II |
| Publication status | Published - 2005 |
| Externally published | Yes |
| Event | 5th International Conference on Computational Science - ICCS 2005 - Atlanta, GA, United States Duration: 2005 May 22 → 2005 May 25 |
Other
| Other | 5th International Conference on Computational Science - ICCS 2005 |
|---|---|
| Country | United States |
| City | Atlanta, GA |
| Period | 05/5/22 → 05/5/25 |
Fingerprint
ASJC Scopus subject areas
- Computer Science (miscellaneous)
Cite this
Practical and provably-secure multicasting over high-delay networks. / Nam, Junghyun; Kim, Hyunjue; Kim, Seung-Joo; Won, Dongho; Yang, Hyungkyu.
Lecture Notes in Computer Science. ed. / V.S. Sunderam; G.D. Albada; P.M.A. Sloot; J.J. Dongarra. Vol. 3515 II. ed. 2005. p. 493-501.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Practical and provably-secure multicasting over high-delay networks
AU - Nam, Junghyun
AU - Kim, Hyunjue
AU - Kim, Seung-Joo
AU - Won, Dongho
AU - Yang, Hyungkyu
PY - 2005
Y1 - 2005
N2 - This paper considers the problem of authenticated key exchange in a dynamic group in which members join and leave the group in an arbitrary fashion. A group key exchange scheme for such a dynamic group is designed to minimize the cost of the rekeying operations associated with group updates. Although a number of schemes have attempted for many years to address this problem, all provably-secure schemes are inadequate in dealing with a dynamic group where group members are spread across a wide area network; their communication overhead for group rekeying is significant in terms of the number of communication rounds or the number of messages, both of which are recognized as the dominant factors that severely slow down group key exchange over a wide area network. In this paper, we propose an efficient key exchange scheme for this scenario and prove its security against an active adversary under the factoring assumption. The proposed scheme requires only a constant number of rounds while achieving low message complexity.
AB - This paper considers the problem of authenticated key exchange in a dynamic group in which members join and leave the group in an arbitrary fashion. A group key exchange scheme for such a dynamic group is designed to minimize the cost of the rekeying operations associated with group updates. Although a number of schemes have attempted for many years to address this problem, all provably-secure schemes are inadequate in dealing with a dynamic group where group members are spread across a wide area network; their communication overhead for group rekeying is significant in terms of the number of communication rounds or the number of messages, both of which are recognized as the dominant factors that severely slow down group key exchange over a wide area network. In this paper, we propose an efficient key exchange scheme for this scenario and prove its security against an active adversary under the factoring assumption. The proposed scheme requires only a constant number of rounds while achieving low message complexity.
UR - http://www.scopus.com/inward/record.url?scp=25144450082&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=25144450082&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:25144450082
VL - 3515
SP - 493
EP - 501
BT - Lecture Notes in Computer Science
A2 - Sunderam, V.S.
A2 - Albada, G.D.
A2 - Sloot, P.M.A.
A2 - Dongarra, J.J.
ER -