Performance evaluation of secure group communication

Hiroshi Toyoizumi, Matsuyoshi Takaya

研究成果: Article

2 引用 (Scopus)

抄録

There are demands for secure group communication on the internet, such as pay-per-view type broadcasting, business confidential information sharing and teleconference. Secure communication inside a groups on an open network is critical to enhance the internet capability. The public key system is not sufficient to support the group security, since it is not scalable for large groups. Some researchers propose a scalable group security model, managing several common keys for encryption and decryption sharing inside the community. In this paper, we will evaluate the performance of these group security model. Using M/G/∞ queueing models and the basic queueing theory, we show how to find the optimal condition of the allocation of the common keys if the joins to group is a Poisson process. In addition, we show our optimal condition may work for more general arrival processes by using the cross covariance formula (a variant of Papangelou's formula) for the stochastic intensity of departure process.

元の言語English
ページ(範囲)38-50
ページ数13
ジャーナルJournal of the Operations Research Society of Japan
47
発行部数1
出版物ステータスPublished - 2004 3
外部発表Yes

Fingerprint

Performance evaluation
Group communication
World Wide Web
Information sharing
Large groups
Queueing model
Communication
Encryption
Queueing theory
Work conditions
Broadcasting
Join
Business information
Poisson process

ASJC Scopus subject areas

  • Decision Sciences(all)
  • Management Science and Operations Research

これを引用

Performance evaluation of secure group communication. / Toyoizumi, Hiroshi; Takaya, Matsuyoshi.

:: Journal of the Operations Research Society of Japan, 巻 47, 番号 1, 03.2004, p. 38-50.

研究成果: Article

@article{fdd24889da4747e7905dec14bb369dc5,
title = "Performance evaluation of secure group communication",
abstract = "There are demands for secure group communication on the internet, such as pay-per-view type broadcasting, business confidential information sharing and teleconference. Secure communication inside a groups on an open network is critical to enhance the internet capability. The public key system is not sufficient to support the group security, since it is not scalable for large groups. Some researchers propose a scalable group security model, managing several common keys for encryption and decryption sharing inside the community. In this paper, we will evaluate the performance of these group security model. Using M/G/∞ queueing models and the basic queueing theory, we show how to find the optimal condition of the allocation of the common keys if the joins to group is a Poisson process. In addition, we show our optimal condition may work for more general arrival processes by using the cross covariance formula (a variant of Papangelou's formula) for the stochastic intensity of departure process.",
keywords = "Applied probability, Information technologies, Markov process, Queue, Telecommunication",
author = "Hiroshi Toyoizumi and Matsuyoshi Takaya",
year = "2004",
month = "3",
language = "English",
volume = "47",
pages = "38--50",
journal = "Journal of the Operations Research Society of Japan",
issn = "0453-4514",
publisher = "Operations Research Society of Japan",
number = "1",

}

TY - JOUR

T1 - Performance evaluation of secure group communication

AU - Toyoizumi, Hiroshi

AU - Takaya, Matsuyoshi

PY - 2004/3

Y1 - 2004/3

N2 - There are demands for secure group communication on the internet, such as pay-per-view type broadcasting, business confidential information sharing and teleconference. Secure communication inside a groups on an open network is critical to enhance the internet capability. The public key system is not sufficient to support the group security, since it is not scalable for large groups. Some researchers propose a scalable group security model, managing several common keys for encryption and decryption sharing inside the community. In this paper, we will evaluate the performance of these group security model. Using M/G/∞ queueing models and the basic queueing theory, we show how to find the optimal condition of the allocation of the common keys if the joins to group is a Poisson process. In addition, we show our optimal condition may work for more general arrival processes by using the cross covariance formula (a variant of Papangelou's formula) for the stochastic intensity of departure process.

AB - There are demands for secure group communication on the internet, such as pay-per-view type broadcasting, business confidential information sharing and teleconference. Secure communication inside a groups on an open network is critical to enhance the internet capability. The public key system is not sufficient to support the group security, since it is not scalable for large groups. Some researchers propose a scalable group security model, managing several common keys for encryption and decryption sharing inside the community. In this paper, we will evaluate the performance of these group security model. Using M/G/∞ queueing models and the basic queueing theory, we show how to find the optimal condition of the allocation of the common keys if the joins to group is a Poisson process. In addition, we show our optimal condition may work for more general arrival processes by using the cross covariance formula (a variant of Papangelou's formula) for the stochastic intensity of departure process.

KW - Applied probability

KW - Information technologies

KW - Markov process

KW - Queue

KW - Telecommunication

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

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

M3 - Article

AN - SCOPUS:3242758268

VL - 47

SP - 38

EP - 50

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 1

ER -