Multicast rekeying protocol based on Huffman one-way function tree

Lie Huang Zhu*, Yuan Da Cao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

Considering the difference in probability of various members leaving the communication group the paper proposes a multicast rekeying protocol based Huffman one-way function tree (HOFT). The paper introduces the OFT multicast rekeying protocol, proposes the HOFT multicast rekeying protocol including the HOFT initialization algorithm and the HOFT multicast rekeying protocol when a member adds to or leaves the communication group. The paper then analyzes the performance of the HOFT multicast rekeying protocol on the number of rekeying messages and the number of keys the GC and member should save. Average performance of the HOFT multicast rekeying protocol appears to be the best among all the multicast rekeying protocols based on OFT.

Original languageEnglish
Pages (from-to)524-527+540
JournalBeijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
Volume24
Issue number6
Publication statusPublished - Jun 2004

Keywords

  • Huffman
  • Multicast
  • One-way function tree
  • Rekeying

Fingerprint

Dive into the research topics of 'Multicast rekeying protocol based on Huffman one-way function tree'. Together they form a unique fingerprint.

Cite this