Group key distribution scheme for reducing required rekey message size

Ryuzou Nishi, Kouichi Sakurai

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

Abstract

Generally, systems, such as the pay-per-view TV, require secure multi-party communication. In these systems, group key is required, and members participate in and leave from party frequently, so that, group key materials of all members of the network must be updated. Therefore, an approach which tries to distribute a key materials effectively is proposed from Onen-Molva, the approach divides the members of the network into the two sub-groups according to the relative length in the period of the operation of the each member, and the approach uses FEC (Forward Error Correction) and an ARQ (Automatic Repeat reQuest) in the key update to the group of the long network-connection period. There are some issues in their proposal. When the communication quality is good, its efficiency is less, and there is an overhead in the bandwidth. Therefore, we propose an efficient group key distribution method using M-ary coding for a key message without using FEC and an ARQ, and transmitting this in parallel with the non-key message.

Original languageEnglish
Title of host publicationProceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
EditorsJ. Ma, L.T. Yang
Pages280-284
Number of pages5
DOIs
Publication statusPublished - Sep 1 2005
Event11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 - Fukuoka, Japan
Duration: Jul 20 2005Jul 22 2005

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Volume2
ISSN (Print)1521-9097

Other

Other11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
CountryJapan
CityFukuoka
Period7/20/057/22/05

Fingerprint

Forward error correction
Communication
Bandwidth

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Nishi, R., & Sakurai, K. (2005). Group key distribution scheme for reducing required rekey message size. In J. Ma, & L. T. Yang (Eds.), Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 (pp. 280-284). (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 2). https://doi.org/10.1109/ICPADS.2005.162

Group key distribution scheme for reducing required rekey message size. / Nishi, Ryuzou; Sakurai, Kouichi.

Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. ed. / J. Ma; L.T. Yang. 2005. p. 280-284 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; Vol. 2).

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

Nishi, R & Sakurai, K 2005, Group key distribution scheme for reducing required rekey message size. in J Ma & LT Yang (eds), Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, vol. 2, pp. 280-284, 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005, Fukuoka, Japan, 7/20/05. https://doi.org/10.1109/ICPADS.2005.162
Nishi R, Sakurai K. Group key distribution scheme for reducing required rekey message size. In Ma J, Yang LT, editors, Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. 2005. p. 280-284. (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS). https://doi.org/10.1109/ICPADS.2005.162
Nishi, Ryuzou ; Sakurai, Kouichi. / Group key distribution scheme for reducing required rekey message size. Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005. editor / J. Ma ; L.T. Yang. 2005. pp. 280-284 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS).
@inproceedings{0b59cd6035a64e16bdaf19c29ba58fb6,
title = "Group key distribution scheme for reducing required rekey message size",
abstract = "Generally, systems, such as the pay-per-view TV, require secure multi-party communication. In these systems, group key is required, and members participate in and leave from party frequently, so that, group key materials of all members of the network must be updated. Therefore, an approach which tries to distribute a key materials effectively is proposed from Onen-Molva, the approach divides the members of the network into the two sub-groups according to the relative length in the period of the operation of the each member, and the approach uses FEC (Forward Error Correction) and an ARQ (Automatic Repeat reQuest) in the key update to the group of the long network-connection period. There are some issues in their proposal. When the communication quality is good, its efficiency is less, and there is an overhead in the bandwidth. Therefore, we propose an efficient group key distribution method using M-ary coding for a key message without using FEC and an ARQ, and transmitting this in parallel with the non-key message.",
author = "Ryuzou Nishi and Kouichi Sakurai",
year = "2005",
month = "9",
day = "1",
doi = "10.1109/ICPADS.2005.162",
language = "English",
isbn = "0769522815",
series = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",
pages = "280--284",
editor = "J. Ma and L.T. Yang",
booktitle = "Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005",

}

TY - GEN

T1 - Group key distribution scheme for reducing required rekey message size

AU - Nishi, Ryuzou

AU - Sakurai, Kouichi

PY - 2005/9/1

Y1 - 2005/9/1

N2 - Generally, systems, such as the pay-per-view TV, require secure multi-party communication. In these systems, group key is required, and members participate in and leave from party frequently, so that, group key materials of all members of the network must be updated. Therefore, an approach which tries to distribute a key materials effectively is proposed from Onen-Molva, the approach divides the members of the network into the two sub-groups according to the relative length in the period of the operation of the each member, and the approach uses FEC (Forward Error Correction) and an ARQ (Automatic Repeat reQuest) in the key update to the group of the long network-connection period. There are some issues in their proposal. When the communication quality is good, its efficiency is less, and there is an overhead in the bandwidth. Therefore, we propose an efficient group key distribution method using M-ary coding for a key message without using FEC and an ARQ, and transmitting this in parallel with the non-key message.

AB - Generally, systems, such as the pay-per-view TV, require secure multi-party communication. In these systems, group key is required, and members participate in and leave from party frequently, so that, group key materials of all members of the network must be updated. Therefore, an approach which tries to distribute a key materials effectively is proposed from Onen-Molva, the approach divides the members of the network into the two sub-groups according to the relative length in the period of the operation of the each member, and the approach uses FEC (Forward Error Correction) and an ARQ (Automatic Repeat reQuest) in the key update to the group of the long network-connection period. There are some issues in their proposal. When the communication quality is good, its efficiency is less, and there is an overhead in the bandwidth. Therefore, we propose an efficient group key distribution method using M-ary coding for a key message without using FEC and an ARQ, and transmitting this in parallel with the non-key message.

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

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

U2 - 10.1109/ICPADS.2005.162

DO - 10.1109/ICPADS.2005.162

M3 - Conference contribution

AN - SCOPUS:23944471329

SN - 0769522815

T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

SP - 280

EP - 284

BT - Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005

A2 - Ma, J.

A2 - Yang, L.T.

ER -