NDLI: A novel high-order tree for secure multicast key management

Content Provider	IEEE Xplore Digital Library
Author	Lu, H.
Copyright Year	1968
Abstract	Multicast is used to deliver packets to a group of users. To prevent users outside the group from eavesdropping, a group key is maintained to encrypt the group communication, and the group key is changed (rekeying) when a new member joins the group or an existing member leaves the group. Rekeying costs could be as high as n for a group with n members. The hierarchical key-tree approach is widely used to achieve logarithmic rekeying costs. However, the key tree has to be kept balanced in order to keep logarithmic rekeying costs. Goshi and Ladner propose the height-balanced 2-3 tree (a B-tree of order m=3) and found that it has the best performance among the balancing strategies tested. However, balancing a B-tree [J. Goshi et al., (2003)] after member joining involves splitting oversized tree nodes and results in (m+2)h worst-case rekeying cost, where h is the tree height. We propose an NSBHO (nonsplit balancing high-order) tree in which balancing tree after member joining does not involve node splitting, thus having 2h worst-case rekeying cost. An NSBHO tree is always balanced and its nodes may not satisfy the node properties of a standard B-tree. Our proposed NSBHO tree has the same worst-case rekeying cost incurred by a member removing as a B-tree [J. Goshi et al., (2003)] does. Our experiments show that the NSBHO tree has better average-case rekeying performance and far superior worst-case rekeying performance than a B-tree.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	214
Ending Page	224
Page Count	11
File Size	904333
File Format	PDF
ISSN	00189340
Volume Number	54
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Complexity theory Tree data structures Cryptography rekeying. Index Terms- Group key management secure multicast dynamic group high-order tree balanced tree
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Dynamic Balanced Key Tree Management for Secure Multicast Communications

High-Performance Rekeying Processor Architecture for Group Key Management

Tree parity machine rekeying architectures

Efficient Multicast Key Distribution Using HOWP-Based Dynamic Group Access Structures

Efficient Rekeying Framework for Secure Multicast with Diverse-Subscription-Period Mobile Users

Chinese remainder Theorem based centralised group key management for secure multicast communication

Multidimensional Height-Balanced Trees

Inter cluster communication and rekeying technique for multicast security in mobile ad hoc networks

Improving memory encryption performance in secure processors

A novel high-order tree for secure multicast key management

Similar Documents

Dynamic Balanced Key Tree Management for Secure Multicast Communications

High-Performance Rekeying Processor Architecture for Group Key Management

Tree parity machine rekeying architectures

Efficient Multicast Key Distribution Using HOWP-Based Dynamic Group Access Structures

Efficient Rekeying Framework for Secure Multicast with Diverse-Subscription-Period Mobile Users

Chinese remainder Theorem based centralised group key management for secure multicast communication

Multidimensional Height-Balanced Trees

Inter cluster communication and rekeying technique for multicast security in mobile ad hoc networks

Improving memory encryption performance in secure processors

A novel high-order tree for secure multicast key management