New Group Rekeying Algorithm Using Combination of Secret Mask Patterns and Hash Values
Summary :
Efficient group rekeying is an important issue for secure group communications. Most of the proposed group rekeying methods require expensive encryption and decryption operations to rekey the group. However, in a model where a trusted server is used to distribute group keys, the trusted server may become a bottleneck because of the expensive computation operations, such as encryption, that it has to perform. In this paper, we propose a new stateless group rekeying scheme to solve the multicast group rekeying problem. In our proposed scheme, the trusted server combines mask-based key-location hiding with the simple XOR-encryption using secret hash values to rekey the group. Without affecting the system security, our approach reduces the processing cost of the trusted server by eliminating the need to encrypt the group key. Moreover, to acquire the group key, the computational cost of the group members is low and stable regardless of the rekeying message size.
- Publication
- IEICE TRANSACTIONS on Information Vol.E89-D No.9 pp.2525-2532
- Publication Date
- 2006/09/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e89-d.9.2525
- Type of Manuscript
- PAPER
- Category
- Application Information 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
Yaser M. ASEM, Atsushi KARA, "New Group Rekeying Algorithm Using Combination of Secret Mask Patterns and Hash Values" in IEICE TRANSACTIONS on Information,
vol. E89-D, no. 9, pp. 2525-2532, September 2006, doi: 10.1093/ietisy/e89-d.9.2525.
Abstract: Efficient group rekeying is an important issue for secure group communications. Most of the proposed group rekeying methods require expensive encryption and decryption operations to rekey the group. However, in a model where a trusted server is used to distribute group keys, the trusted server may become a bottleneck because of the expensive computation operations, such as encryption, that it has to perform. In this paper, we propose a new stateless group rekeying scheme to solve the multicast group rekeying problem. In our proposed scheme, the trusted server combines mask-based key-location hiding with the simple XOR-encryption using secret hash values to rekey the group. Without affecting the system security, our approach reduces the processing cost of the trusted server by eliminating the need to encrypt the group key. Moreover, to acquire the group key, the computational cost of the group members is low and stable regardless of the rekeying message size.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.9.2525/_p
Copy
@ARTICLE{e89-d_9_2525,
author={Yaser M. ASEM, Atsushi KARA, },
journal={IEICE TRANSACTIONS on Information},
title={New Group Rekeying Algorithm Using Combination of Secret Mask Patterns and Hash Values},
year={2006},
volume={E89-D},
number={9},
pages={2525-2532},
abstract={Efficient group rekeying is an important issue for secure group communications. Most of the proposed group rekeying methods require expensive encryption and decryption operations to rekey the group. However, in a model where a trusted server is used to distribute group keys, the trusted server may become a bottleneck because of the expensive computation operations, such as encryption, that it has to perform. In this paper, we propose a new stateless group rekeying scheme to solve the multicast group rekeying problem. In our proposed scheme, the trusted server combines mask-based key-location hiding with the simple XOR-encryption using secret hash values to rekey the group. Without affecting the system security, our approach reduces the processing cost of the trusted server by eliminating the need to encrypt the group key. Moreover, to acquire the group key, the computational cost of the group members is low and stable regardless of the rekeying message size.},
keywords={},
doi={10.1093/ietisy/e89-d.9.2525},
ISSN={1745-1361},
month={September},}
Copy
TY - JOUR
TI - New Group Rekeying Algorithm Using Combination of Secret Mask Patterns and Hash Values
T2 - IEICE TRANSACTIONS on Information
SP - 2525
EP - 2532
AU - Yaser M. ASEM
AU - Atsushi KARA
PY - 2006
DO - 10.1093/ietisy/e89-d.9.2525
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2006
AB - Efficient group rekeying is an important issue for secure group communications. Most of the proposed group rekeying methods require expensive encryption and decryption operations to rekey the group. However, in a model where a trusted server is used to distribute group keys, the trusted server may become a bottleneck because of the expensive computation operations, such as encryption, that it has to perform. In this paper, we propose a new stateless group rekeying scheme to solve the multicast group rekeying problem. In our proposed scheme, the trusted server combines mask-based key-location hiding with the simple XOR-encryption using secret hash values to rekey the group. Without affecting the system security, our approach reduces the processing cost of the trusted server by eliminating the need to encrypt the group key. Moreover, to acquire the group key, the computational cost of the group members is low and stable regardless of the rekeying message size.
ER -
English
