Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11428848_65 | International Conference on Computational Science (2) |
Keywords | Field | DocType |
efficient key exchange scheme,group rekeying,group key exchange scheme,constant number,group updates,group key exchange,provably-secure multicasting,dynamic group,group member,wide area network,high-delay network,authenticated key exchange,key exchange,it security,provable security | Key exchange,Computer science,Authenticated Key Exchange,Random oracle,Rekeying,Forward secrecy,Retard,Multicast,Wide area network,Distributed computing | Conference |
Volume | ISSN | ISBN |
3515 | 0302-9743 | 3-540-26043-9 |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junghyun Nam | 1 | 357 | 47.86 |
| Hyunjue Kim | 2 | 15 | 1.68 |
| Seungjoo Kim | 3 | 939 | 84.84 |
| Dongho Won | 4 | 1262 | 154.14 |
| Hyungkyu Yang | 5 | 5 | 3.46 |