Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Optimising group key management for frequent-membership-change environment in vanet

Authors
Bold, BaasantsetsegPark, Young Hoon
Issue Date
Jan-2020
Publisher
Inderscience Publisherseditor@inderscience.com
Citation
International Journal of Internet Technology and Secured Transactions, v.10, no.4, pp.407 - 419
Journal Title
International Journal of Internet Technology and Secured Transactions
Volume
10
Number
4
Start Page
407
End Page
419
URI
https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/1681
DOI
10.1504/IJITST.2020.108136
ISSN
1748-569X
Abstract
In this paper, we propose a tree-based optimal group key management algorithm using a batch rekeying technique, which changes a set of keys at a certain time interval. In batch rekeying, the server collects all the joining and leaving requests during the time interval, and generates rekeying messages. In the proposed algorithm, when a vehicle joins a group, it is located at a certain leaf node of the key-tree according to its leaving time. This reduces the size of the rekeying messages because the vehicles that leave during the same time interval are concentrated on the same parent node. With the proposed scheme, tree-based group key management can be employed to the VANET because it solves the communication overhead problem. Using simulations, we demonstrate that our scheme remarkably reduces the communication cost for updating the group key.
Files in This Item
Go to Link
Appears in
Collections
공과대학 > 소프트웨어학부 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Park, Young Hoon photo

Park, Young Hoon
공과대학 (소프트웨어학부)
Read more

Altmetrics

Total Views & Downloads

BROWSE