2014Unpublished venueRequires access

An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees

Omar Zakaria, Aisha Hassan Abdalla Hashim, Wan Haslina Hassan

Open publisher page 4 citations

Abstract

Security is vital for many multicast-based application and services. Secure group key management is on of the challenging problems for multicast communication with large number of members. Where for each membership variation the group key must be updated and redistributed to all currently active members only. This causes a higher communication overhead in large size multicast group with high number of users joining or leaving the group. Logical Key Hierarchy which uses the key tree structure is proposed to reduce the communication cost of rekeying procedure and reduces the required number of rekeying messages. Furthermore, batch rekeying is proposed to reduce the rekeying cost by preform rekeying in predefined intervals instead of updating the keys after each join or leave. In this paper, a new scheme based on multiple key trees is proposed. Instead of using only a single key tree multiple key trees are used and at the end of each batch time the algorithm decides which tree will be used to update the keys. This paper shows that utilizing multiple key trees can efficiently decrease the rekeying communication overhead using batch rekeying scheme in tree-based architecture.

About this research paper

What this paper is about

Security is vital for many multicast-based application and services. Secure group key management is on of the challenging problems for multicast communication with large number of members. Where for each membership variation the group key must be updated and redistributed to all currently active members only. This causes a higher communication overhead in large size multicast group with high number of users joining or leaving the group. Logical Key Hierarchy which uses the key tree structure is proposed to reduce the communication cost of rekeying procedure and reduces the required number of rekeying messages. Furthermore, batch rekeying is proposed to reduce the rekeying cost by preform rekeying in predefined intervals instead of updating the keys after each join or leave. In this paper, a new scheme based on multiple key trees is proposed. Instead of using only a single key tree multiple key trees are used and at the end of each batch time the algorithm decides which tree will be used to update the keys. This paper shows that utilizing multiple key trees can efficiently decrease the rekeying communication overhead using batch rekeying scheme in tree-based architecture.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Security is vital for many multicast-based application and services. Secure group key management is on of the challenging problems for multicast communication with large number of members. Where for each membership variation the group key must be updated and redistributed to all currently active members only. This causes a higher communication overhead in large size multicast group with high number of users joining or leaving the group. Logical Key Hierarchy which uses the key tree structure is proposed to reduce the communication cost of rekeying procedure and reduces the required number of rekeying messages. Furthermore, batch rekeying is proposed to reduce the rekeying cost by preform rekeying in predefined intervals instead of updating the keys after each join or leave. In this paper, a new scheme based on multiple key trees is proposed. Instead of using only a single key tree multiple key trees are used and at the end of each batch time the algorithm decides which tree will be used to update the keys. This paper shows that utilizing multiple key trees can efficiently decrease the rekeying communication overhead using batch rekeying scheme in tree-based architecture.

Key concepts: Rekeying, Secure multicast, Computer science, Multicast, Computer network, Overhead (engineering), Communication in small groups, Key management

Related papers

Back to paper searchBrowse research topicsOriginal source
An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees — Research Paper | ScholarLens