Practical and provably-secure multicasting over high-delay networks

Junghyun Nam, Hyunjue Kim, Seung-Joo Kim, Dongho Won, Hyungkyu Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsV.S. Sunderam, G.D. Albada, P.M.A. Sloot, J.J. Dongarra
Pages493-501
Number of pages9
Volume3515
EditionII
Publication statusPublished - 2005
Externally publishedYes
Event5th International Conference on Computational Science - ICCS 2005 - Atlanta, GA, United States
Duration: 2005 May 222005 May 25

Other

Other5th International Conference on Computational Science - ICCS 2005
CountryUnited States
CityAtlanta, GA
Period05/5/2205/5/25

Fingerprint

Multicasting
Wide area networks
Communication
Costs

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Nam, J., Kim, H., Kim, S-J., Won, D., & Yang, H. (2005). Practical and provably-secure multicasting over high-delay networks. In V. S. Sunderam, G. D. Albada, P. M. A. Sloot, & J. J. Dongarra (Eds.), Lecture Notes in Computer Science (II ed., Vol. 3515, pp. 493-501)

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 proceedingConference contribution

Nam, J, Kim, H, Kim, S-J, Won, D & Yang, H 2005, Practical and provably-secure multicasting over high-delay networks. in VS Sunderam, GD Albada, PMA Sloot & JJ Dongarra (eds), Lecture Notes in Computer Science. II edn, vol. 3515, pp. 493-501, 5th International Conference on Computational Science - ICCS 2005, Atlanta, GA, United States, 05/5/22.
Nam J, Kim H, Kim S-J, Won D, Yang H. Practical and provably-secure multicasting over high-delay networks. In Sunderam VS, Albada GD, Sloot PMA, Dongarra JJ, editors, Lecture Notes in Computer Science. II ed. Vol. 3515. 2005. p. 493-501
Nam, Junghyun ; Kim, Hyunjue ; Kim, Seung-Joo ; Won, Dongho ; Yang, Hyungkyu. / Practical and provably-secure multicasting over high-delay networks. Lecture Notes in Computer Science. editor / V.S. Sunderam ; G.D. Albada ; P.M.A. Sloot ; J.J. Dongarra. Vol. 3515 II. ed. 2005. pp. 493-501
@inproceedings{e2ec08eab8ba4c41b0d98f01c65b7958,
title = "Practical and provably-secure multicasting over high-delay networks",
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.",
author = "Junghyun Nam and Hyunjue Kim and Seung-Joo Kim and Dongho Won and Hyungkyu Yang",
year = "2005",
language = "English",
volume = "3515",
pages = "493--501",
editor = "V.S. Sunderam and G.D. Albada and P.M.A. Sloot and J.J. Dongarra",
booktitle = "Lecture Notes in Computer Science",
edition = "II",

}

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 -