TY - JOUR
T1 - Practical and provably-secure multicasting over high-delay networks
AU - Nam, Junghyun
AU - Kim, Hyunjue
AU - Kim, Seungjoo
AU - Won, Dongho
AU - Yang, Hyungkyu
N1 - Funding Information:
★ Seungjoo Kim is the corresponding author for this paper. This work was supported by the University IT Research Center Project funded by the Korean Ministry of Information and Communication.
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
U2 - 10.1007/11428848_65
DO - 10.1007/11428848_65
M3 - Conference article
AN - SCOPUS:25144450082
VL - 3515
SP - 493
EP - 501
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SN - 0302-9743
IS - II
T2 - 5th International Conference on Computational Science - ICCS 2005
Y2 - 22 May 2005 through 25 May 2005
ER -