Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network
In mobile multihop relay (MMR) networks, Relay multicast rekeying algorithm (RMRA) is meant to ensure secure multicast communication and selective updating of keys in MMR networks. However, in RMRA, the rekeying is carried out after a specific interval of time, which cannot ensure the security for m...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kohat University of Science and Technology (KUST), Pakistan
2014
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/11301/ http://ir.unimas.my/id/eprint/11301/7/Secure.pdf |
| _version_ | 1848836981248753664 |
|---|---|
| author | Adnan, Shahid Khan |
| author_facet | Adnan, Shahid Khan |
| author_sort | Adnan, Shahid Khan |
| building | UNIMAS Institutional Repository |
| collection | Online Access |
| description | In mobile multihop relay (MMR) networks, Relay multicast rekeying algorithm (RMRA) is meant to ensure secure multicast communication and selective updating of keys in MMR networks. However, in RMRA, the rekeying is carried out after a specific interval of time, which cannot ensure the security for multicast communication on joining the member. Secondly, the rekeying scheme generates a huge communication overhead on the serving multihop relay base station (MR-BS) on frequent joining of members. Lastly, there is nothing about when a member left the group communication. Thus, the rekeying scheme of RMRA fails to provide forward and backward secrecy and also is not scalable. To solve this problem, an improved rekeying scheme based on broadcasting a new seed value on joining and leaving of a member for updating the ongoing key management is proposed. The proposed scheme solves
the issue of forward and backward secrecy and the scalability in a very simplified way. The forward and backward secrecy of the proposed scheme has been extensively validated by formal method using rank theorem. Furthermore, mathematical derivation showed
that the proposed scheme out-performed the RMRA in terms of communication cost and complexity. |
| first_indexed | 2025-11-15T06:32:24Z |
| format | Article |
| id | unimas-11301 |
| institution | Universiti Malaysia Sarawak |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T06:32:24Z |
| publishDate | 2014 |
| publisher | Kohat University of Science and Technology (KUST), Pakistan |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | unimas-113012022-07-05T07:03:36Z http://ir.unimas.my/id/eprint/11301/ Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network Adnan, Shahid Khan T Technology (General) In mobile multihop relay (MMR) networks, Relay multicast rekeying algorithm (RMRA) is meant to ensure secure multicast communication and selective updating of keys in MMR networks. However, in RMRA, the rekeying is carried out after a specific interval of time, which cannot ensure the security for multicast communication on joining the member. Secondly, the rekeying scheme generates a huge communication overhead on the serving multihop relay base station (MR-BS) on frequent joining of members. Lastly, there is nothing about when a member left the group communication. Thus, the rekeying scheme of RMRA fails to provide forward and backward secrecy and also is not scalable. To solve this problem, an improved rekeying scheme based on broadcasting a new seed value on joining and leaving of a member for updating the ongoing key management is proposed. The proposed scheme solves the issue of forward and backward secrecy and the scalability in a very simplified way. The forward and backward secrecy of the proposed scheme has been extensively validated by formal method using rank theorem. Furthermore, mathematical derivation showed that the proposed scheme out-performed the RMRA in terms of communication cost and complexity. Kohat University of Science and Technology (KUST), Pakistan 2014 Article PeerReviewed text en http://ir.unimas.my/id/eprint/11301/7/Secure.pdf Adnan, Shahid Khan (2014) Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network. International Journal of Communication Networks and Information Security (IJCNIS), 6 (3). ISSN 2073-607X http://www.ijcnis.org/index.php/ijcnis/article/view/745 |
| spellingShingle | T Technology (General) Adnan, Shahid Khan Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network |
| title | Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network |
| title_full | Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network |
| title_fullStr | Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network |
| title_full_unstemmed | Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network |
| title_short | Secure and Efficient Distributed Relay-Based Rekeying Algorithm for Group Communication in Mobile Multihop Relay Network |
| title_sort | secure and efficient distributed relay-based rekeying algorithm for group communication in mobile multihop relay network |
| topic | T Technology (General) |
| url | http://ir.unimas.my/id/eprint/11301/ http://ir.unimas.my/id/eprint/11301/ http://ir.unimas.my/id/eprint/11301/7/Secure.pdf |