Key agreement for collaborative groups has become an increasingly popular research area. However, most of previous work requires each member to not only maintain the whole key tree structure whose size is O(N), where N is the size of group, but also involve rekeying operation upon each membership change, resulting in high costs in terms of storage, communication and computation and thus suffers from poor scalability. In this paper, we propose a scalable Distributed and collaborative group key agreement scheme using a Virtual Key Tree (D-VKT). Each group member in D-VKT only reserves and maintains partial information of the whole key tree structure with requirement of O(log N). Furthermore, a distributed tree balancing algorithm is presented to keep the whole key tree as balanced as possible for rekeying efficiency. In addition, a distributed group batch rekeying protocol is proposed to further reduce the computation and communication workload of group rekeying in a highly dynamic environment. The experiment results demonstrate that D-VKT can scale to large and dynamic collaborative groups.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Jiang ZHANG, Li-Feng SUN, Yun TANG, Shi-Qiang YANG, "D-VKT: A Scalable Distributed Key Agreement Scheme for Dynamic Collaborative Groups" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 4, pp. 750-760, April 2007, doi: 10.1093/ietcom/e90-b.4.750.
Abstract: Key agreement for collaborative groups has become an increasingly popular research area. However, most of previous work requires each member to not only maintain the whole key tree structure whose size is O(N), where N is the size of group, but also involve rekeying operation upon each membership change, resulting in high costs in terms of storage, communication and computation and thus suffers from poor scalability. In this paper, we propose a scalable Distributed and collaborative group key agreement scheme using a Virtual Key Tree (D-VKT). Each group member in D-VKT only reserves and maintains partial information of the whole key tree structure with requirement of O(log N). Furthermore, a distributed tree balancing algorithm is presented to keep the whole key tree as balanced as possible for rekeying efficiency. In addition, a distributed group batch rekeying protocol is proposed to further reduce the computation and communication workload of group rekeying in a highly dynamic environment. The experiment results demonstrate that D-VKT can scale to large and dynamic collaborative groups.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.4.750/_p
Copy
@ARTICLE{e90-b_4_750,
author={Jiang ZHANG, Li-Feng SUN, Yun TANG, Shi-Qiang YANG, },
journal={IEICE TRANSACTIONS on Communications},
title={D-VKT: A Scalable Distributed Key Agreement Scheme for Dynamic Collaborative Groups},
year={2007},
volume={E90-B},
number={4},
pages={750-760},
abstract={Key agreement for collaborative groups has become an increasingly popular research area. However, most of previous work requires each member to not only maintain the whole key tree structure whose size is O(N), where N is the size of group, but also involve rekeying operation upon each membership change, resulting in high costs in terms of storage, communication and computation and thus suffers from poor scalability. In this paper, we propose a scalable Distributed and collaborative group key agreement scheme using a Virtual Key Tree (D-VKT). Each group member in D-VKT only reserves and maintains partial information of the whole key tree structure with requirement of O(log N). Furthermore, a distributed tree balancing algorithm is presented to keep the whole key tree as balanced as possible for rekeying efficiency. In addition, a distributed group batch rekeying protocol is proposed to further reduce the computation and communication workload of group rekeying in a highly dynamic environment. The experiment results demonstrate that D-VKT can scale to large and dynamic collaborative groups.},
keywords={},
doi={10.1093/ietcom/e90-b.4.750},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - D-VKT: A Scalable Distributed Key Agreement Scheme for Dynamic Collaborative Groups
T2 - IEICE TRANSACTIONS on Communications
SP - 750
EP - 760
AU - Jiang ZHANG
AU - Li-Feng SUN
AU - Yun TANG
AU - Shi-Qiang YANG
PY - 2007
DO - 10.1093/ietcom/e90-b.4.750
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2007
AB - Key agreement for collaborative groups has become an increasingly popular research area. However, most of previous work requires each member to not only maintain the whole key tree structure whose size is O(N), where N is the size of group, but also involve rekeying operation upon each membership change, resulting in high costs in terms of storage, communication and computation and thus suffers from poor scalability. In this paper, we propose a scalable Distributed and collaborative group key agreement scheme using a Virtual Key Tree (D-VKT). Each group member in D-VKT only reserves and maintains partial information of the whole key tree structure with requirement of O(log N). Furthermore, a distributed tree balancing algorithm is presented to keep the whole key tree as balanced as possible for rekeying efficiency. In addition, a distributed group batch rekeying protocol is proposed to further reduce the computation and communication workload of group rekeying in a highly dynamic environment. The experiment results demonstrate that D-VKT can scale to large and dynamic collaborative groups.
ER -