Comparison of scalable key distribution schemes for secure group communication

Lakshminath R. Dondeti, Sarit Mukherjee, Ashok K Samal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Scalable secure key distribution is the most important feature of a scalable secure group communication protocol. Most of the existing scalable secure group communication protocols are based on a hierarchical key distribution tree. These schemes can be classified as hierarchical node based schemes and hierarchical key based schemes. In this paper, we compare recently proposed hierarchical key distribution schemes through simulation using real-life multicast group membership traces. Our simulations show that hierarchical node based approaches better distribute encryption cost among the entities of a multicast group. However, hierarchical node based schemes `trust' internal nodes of a key distribution tree. We show that the dual encryption protocol recently proposed by us overcomes the aforementioned limitation of hierarchical node based schemes, with a marginal performance penalty.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages1774-1778
Number of pages5
Volume3
StatePublished - 1999
Event1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz
Duration: Dec 5 1999Dec 9 1999

Other

Other1999 IEEE Global Telecommunication Conference - GLOBECOM'99
CityRio de Janeiro, Braz
Period12/5/9912/9/99

Fingerprint

communication
Network protocols
Cryptography
Communication
simulation
distribution
comparison
Costs
cost
protocol
penalty

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Dondeti, L. R., Mukherjee, S., & Samal, A. K. (1999). Comparison of scalable key distribution schemes for secure group communication. In Conference Record / IEEE Global Telecommunications Conference (Vol. 3, pp. 1774-1778). Piscataway, NJ, United States: IEEE.

Comparison of scalable key distribution schemes for secure group communication. / Dondeti, Lakshminath R.; Mukherjee, Sarit; Samal, Ashok K.

Conference Record / IEEE Global Telecommunications Conference. Vol. 3 Piscataway, NJ, United States : IEEE, 1999. p. 1774-1778.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dondeti, LR, Mukherjee, S & Samal, AK 1999, Comparison of scalable key distribution schemes for secure group communication. in Conference Record / IEEE Global Telecommunications Conference. vol. 3, IEEE, Piscataway, NJ, United States, pp. 1774-1778, 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, 12/5/99.
Dondeti LR, Mukherjee S, Samal AK. Comparison of scalable key distribution schemes for secure group communication. In Conference Record / IEEE Global Telecommunications Conference. Vol. 3. Piscataway, NJ, United States: IEEE. 1999. p. 1774-1778
Dondeti, Lakshminath R. ; Mukherjee, Sarit ; Samal, Ashok K. / Comparison of scalable key distribution schemes for secure group communication. Conference Record / IEEE Global Telecommunications Conference. Vol. 3 Piscataway, NJ, United States : IEEE, 1999. pp. 1774-1778
@inproceedings{a8977dcd63754e95a5710d4fc741de39,
title = "Comparison of scalable key distribution schemes for secure group communication",
abstract = "Scalable secure key distribution is the most important feature of a scalable secure group communication protocol. Most of the existing scalable secure group communication protocols are based on a hierarchical key distribution tree. These schemes can be classified as hierarchical node based schemes and hierarchical key based schemes. In this paper, we compare recently proposed hierarchical key distribution schemes through simulation using real-life multicast group membership traces. Our simulations show that hierarchical node based approaches better distribute encryption cost among the entities of a multicast group. However, hierarchical node based schemes `trust' internal nodes of a key distribution tree. We show that the dual encryption protocol recently proposed by us overcomes the aforementioned limitation of hierarchical node based schemes, with a marginal performance penalty.",
author = "Dondeti, {Lakshminath R.} and Sarit Mukherjee and Samal, {Ashok K}",
year = "1999",
language = "English (US)",
volume = "3",
pages = "1774--1778",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Comparison of scalable key distribution schemes for secure group communication

AU - Dondeti, Lakshminath R.

AU - Mukherjee, Sarit

AU - Samal, Ashok K

PY - 1999

Y1 - 1999

N2 - Scalable secure key distribution is the most important feature of a scalable secure group communication protocol. Most of the existing scalable secure group communication protocols are based on a hierarchical key distribution tree. These schemes can be classified as hierarchical node based schemes and hierarchical key based schemes. In this paper, we compare recently proposed hierarchical key distribution schemes through simulation using real-life multicast group membership traces. Our simulations show that hierarchical node based approaches better distribute encryption cost among the entities of a multicast group. However, hierarchical node based schemes `trust' internal nodes of a key distribution tree. We show that the dual encryption protocol recently proposed by us overcomes the aforementioned limitation of hierarchical node based schemes, with a marginal performance penalty.

AB - Scalable secure key distribution is the most important feature of a scalable secure group communication protocol. Most of the existing scalable secure group communication protocols are based on a hierarchical key distribution tree. These schemes can be classified as hierarchical node based schemes and hierarchical key based schemes. In this paper, we compare recently proposed hierarchical key distribution schemes through simulation using real-life multicast group membership traces. Our simulations show that hierarchical node based approaches better distribute encryption cost among the entities of a multicast group. However, hierarchical node based schemes `trust' internal nodes of a key distribution tree. We show that the dual encryption protocol recently proposed by us overcomes the aforementioned limitation of hierarchical node based schemes, with a marginal performance penalty.

UR - http://www.scopus.com/inward/record.url?scp=0033293428&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033293428&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3

SP - 1774

EP - 1778

BT - Conference Record / IEEE Global Telecommunications Conference

PB - IEEE

CY - Piscataway, NJ, United States

ER -