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

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 mem...

Full description

Bibliographic Details
Main Authors: Zakaria, Omar, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina
Format: Article
Language:English
Published: IJCSNS 2014
Subjects:
Online Access:http://irep.iium.edu.my/41961/
http://irep.iium.edu.my/41961/
http://irep.iium.edu.my/41961/1/20141107.pdf
id iium-41961
recordtype eprints
spelling iium-419612018-06-11T03:39:45Z http://irep.iium.edu.my/41961/ An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees Zakaria, Omar Hassan Abdalla Hashim, Aisha Hassan, Wan Haslina T10.5 Communication of technical information 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. IJCSNS 2014-11 Article PeerReviewed application/pdf en http://irep.iium.edu.my/41961/1/20141107.pdf Zakaria, Omar and Hassan Abdalla Hashim, Aisha and Hassan, Wan Haslina (2014) An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees. International Journal of Computer Science and Network Security (IJCSNS), 14 (11). pp. 35-40. ISSN 1738-7906 http://ijcsns.org/
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic T10.5 Communication of technical information
spellingShingle T10.5 Communication of technical information
Zakaria, Omar
Hassan Abdalla Hashim, Aisha
Hassan, Wan Haslina
An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees
description 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.
format Article
author Zakaria, Omar
Hassan Abdalla Hashim, Aisha
Hassan, Wan Haslina
author_facet Zakaria, Omar
Hassan Abdalla Hashim, Aisha
Hassan, Wan Haslina
author_sort Zakaria, Omar
title An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees
title_short An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees
title_full An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees
title_fullStr An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees
title_full_unstemmed An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees
title_sort efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees
publisher IJCSNS
publishDate 2014
url http://irep.iium.edu.my/41961/
http://irep.iium.edu.my/41961/
http://irep.iium.edu.my/41961/1/20141107.pdf
first_indexed 2023-09-18T20:59:55Z
last_indexed 2023-09-18T20:59:55Z
_version_ 1777410554234667008