Adaptive Rekeying for Secure Multicast
Summary :
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is complete. This interruption is especially necessary if the rekeying is done because a user has left (or is removed). We split the rekeying cost into two parts: the cost of the critical path--where each user receives the new group key, and the cost of the non-critical path--where each user receives any other keys that it needs to obtain. We present a family of algorithms that show the tradeoff between the cost of the critical path and the cost of the non-critical path. Our solutions allow the group controller to choose the appropriate algorithm for key distribution by considering the requirements on critical and non-critical cost. In our solutions, the group controller can dynamically change the algorithm for key distribution to adapt to changing application requirements. Moreover, we argue that our solutions allow the group controller to effectively manage heterogeneous groups where users have different requirements/capabilities.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E86-B No.10 pp.2957-2965
- Publication Date
- 2003/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (IEICE/IEEE Joint Special Issue on Assurance Systems and Networks)
- Category
- Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Sandeep KULKARNI, Bezawada BRUHADESHWAR, "Adaptive Rekeying for Secure Multicast" in IEICE TRANSACTIONS on Communications,
vol. E86-B, no. 10, pp. 2957-2965, October 2003, doi: .
Abstract: In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is complete. This interruption is especially necessary if the rekeying is done because a user has left (or is removed). We split the rekeying cost into two parts: the cost of the critical path--where each user receives the new group key, and the cost of the non-critical path--where each user receives any other keys that it needs to obtain. We present a family of algorithms that show the tradeoff between the cost of the critical path and the cost of the non-critical path. Our solutions allow the group controller to choose the appropriate algorithm for key distribution by considering the requirements on critical and non-critical cost. In our solutions, the group controller can dynamically change the algorithm for key distribution to adapt to changing application requirements. Moreover, we argue that our solutions allow the group controller to effectively manage heterogeneous groups where users have different requirements/capabilities.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_10_2957/_p
Copy
@ARTICLE{e86-b_10_2957,
author={Sandeep KULKARNI, Bezawada BRUHADESHWAR, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Rekeying for Secure Multicast},
year={2003},
volume={E86-B},
number={10},
pages={2957-2965},
abstract={In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is complete. This interruption is especially necessary if the rekeying is done because a user has left (or is removed). We split the rekeying cost into two parts: the cost of the critical path--where each user receives the new group key, and the cost of the non-critical path--where each user receives any other keys that it needs to obtain. We present a family of algorithms that show the tradeoff between the cost of the critical path and the cost of the non-critical path. Our solutions allow the group controller to choose the appropriate algorithm for key distribution by considering the requirements on critical and non-critical cost. In our solutions, the group controller can dynamically change the algorithm for key distribution to adapt to changing application requirements. Moreover, we argue that our solutions allow the group controller to effectively manage heterogeneous groups where users have different requirements/capabilities.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Adaptive Rekeying for Secure Multicast
T2 - IEICE TRANSACTIONS on Communications
SP - 2957
EP - 2965
AU - Sandeep KULKARNI
AU - Bezawada BRUHADESHWAR
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2003
AB - In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying is complete. This interruption is especially necessary if the rekeying is done because a user has left (or is removed). We split the rekeying cost into two parts: the cost of the critical path--where each user receives the new group key, and the cost of the non-critical path--where each user receives any other keys that it needs to obtain. We present a family of algorithms that show the tradeoff between the cost of the critical path and the cost of the non-critical path. Our solutions allow the group controller to choose the appropriate algorithm for key distribution by considering the requirements on critical and non-critical cost. In our solutions, the group controller can dynamically change the algorithm for key distribution to adapt to changing application requirements. Moreover, we argue that our solutions allow the group controller to effectively manage heterogeneous groups where users have different requirements/capabilities.
ER -
English
