Skip to main navigation Skip to search Skip to main content

Re-keying scheme for secure multicast based on multi-group key tree

  • Yang Li*
  • , Guoai Xu
  • , Xinxin Niu
  • , Yixian Yang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A re-keying scheme with multi-group key tree shared between multicast groups under group members (GMs) overlapping condition was presented in this paper, and solved the problem that re-keying cost of multicast groups had a linear relationship with the number of multicast groups. In this scheme, leaf nodes on tree were private keys of GMs, extended root nodes were group keys and keys corresponding to all nodes were updated using Pseudo. Random Function (PRF) and Exclusive OR (XOR) operation. The simulation results of verification system show that this scheme obviously improves re-keying performance to some extent under communication scene with multicast groups.

Original languageEnglish
Title of host publication2010 International Conference on Advanced Intelligence and Awareness Internet, AIAI 2010
Pages68-71
Number of pages4
Edition571 CP
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 International Conference on Advanced Intelligence and Awareness Internet, AIAI 2010 - Beijing, China
Duration: 23 Oct 201025 Oct 2010

Publication series

NameIET Conference Publications
Number571 CP
Volume2010

Conference

Conference2010 International Conference on Advanced Intelligence and Awareness Internet, AIAI 2010
Country/TerritoryChina
CityBeijing
Period23/10/1025/10/10

Fingerprint

Dive into the research topics of 'Re-keying scheme for secure multicast based on multi-group key tree'. Together they form a unique fingerprint.

Cite this