抄録
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 2005 → 7 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 |
|---|---|
| 国 | 日本 |
| 市 | Fukuoka |
| 期間 | 7/20/05 → 7/22/05 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
これを引用
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. 版 / J. Ma; L.T. Yang. 2005. p. 280-284 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS; 巻 2).研究成果: 著書/レポートタイプへの貢献 › 会議での発言
}
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 -