A peer-based recovery scheme for group rekeying in secure multicast

Qingyu Zhang, Kenneth L. Calvert

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

The Logical Key Hierarchy (LKH) provides a scalable and efficient way to distribute session keys to authorized group members in secure group (multicast) communication. However, because multicast is a best-effort service, it requires solve this problem, several FEC-based schemes have been proposed. Although these schemes significantly enhance the reliability of the rekey transmissions, they require significant additional resources at the key server. In this paper we propose a distributed scheme for recovering lost rekey packets. Our scheme allows each member to contact other members to get the missing packets during rekey events, thus avoiding the extra computation and bandwidth resources at the key server. We compare our scheme with a wellknown FEC scheme with respect to latencies experienced by receivers in reasonably large groups. Results show that our scheme yields lower average and 95th- percentile latencies than the FEC-based scheme across several operating regimes.

Original languageEnglish
Pages (from-to)15-25
Number of pages11
JournalInternational Journal of Network Security
Volume6
Issue number1
StatePublished - 2008

Keywords

  • Rekey
  • Reliability
  • Secure multicast

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'A peer-based recovery scheme for group rekeying in secure multicast'. Together they form a unique fingerprint.

Cite this