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

Saved in:
Bibliographic Details
Main Authors: Zakaria, Omar, A. Hashim, Aisha-Hassan, Hassan, Wan H.
Format: Article
Published: 2014
Subjects:
Online Access:http://eprints.utm.my/id/eprint/59606/
http://search.ijcsns.org/02_search/02_search_03.php?number=201411007
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.59606
record_format eprints
spelling my.utm.596062022-04-26T14:30:19Z http://eprints.utm.my/id/eprint/59606/ An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees Zakaria, Omar A. Hashim, Aisha-Hassan Hassan, Wan H. TA Engineering (General). Civil engineering (General) TK Electrical engineering. Electronics Nuclear engineering 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. 2014 Article PeerReviewed Zakaria, Omar and A. Hashim, Aisha-Hassan and Hassan, Wan H. (2014) An efficient scalable batch-rekeying scheme for secure multicast communication using multiple logical key trees. IJCSNS International Journal of Computer Science and Network Security, 14 (11). pp. 35-40. ISSN 1738-7906 http://search.ijcsns.org/02_search/02_search_03.php?number=201411007
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic TA Engineering (General). Civil engineering (General)
TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TA Engineering (General). Civil engineering (General)
TK Electrical engineering. Electronics Nuclear engineering
Zakaria, Omar
A. Hashim, Aisha-Hassan
Hassan, Wan H.
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
A. Hashim, Aisha-Hassan
Hassan, Wan H.
author_facet Zakaria, Omar
A. Hashim, Aisha-Hassan
Hassan, Wan H.
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
publishDate 2014
url http://eprints.utm.my/id/eprint/59606/
http://search.ijcsns.org/02_search/02_search_03.php?number=201411007
_version_ 1732945369599311872
score 13.160551