Group key distribution scheme for reducing required rekey message size

Ryuzou Nishi, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
編集者J. Ma, L.T. Yang
ページ280-284
ページ数5
DOI
出版ステータス出版済み - 9 1 2005
イベント11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005 - Fukuoka, 日本
継続期間: 7 20 20057 22 2005

出版物シリーズ

名前Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
2
ISSN(印刷版)1521-9097

その他

その他11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
Country日本
CityFukuoka
Period7/20/057/22/05

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

フィンガープリント 「Group key distribution scheme for reducing required rekey message size」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル