|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10292
|
| タイトル: | Redesigning Group Key Exchange Protocol based on Bilinear Pairing Suitable for Various Environments |
| 著者: | Desmedt, Yvo
Miyaji, Atsuko |
| キーワード: | group key exchange
pairing
party tree
graph theory |
| 発行日: | 2011-07-19 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 6584/2011 |
| 開始ページ: | 236 |
| 終了ページ: | 254 |
| DOI: | 10.1007/978-3-642-21518-6_17 |
| 抄録: | Group key exchange (GKE) allows a group of n parties to share a common secret key over insecure channels. Since key management is important, NIST is now looking for a standard. The goal of this paper is to redesign GKE using bilinear pairings, proposed by Desmedt and Lange, from the point of view of arrangement of parties. The arrangement of parties is called a party tree in this paper. Actually, we are able to redesign the party tree, to reduce the computational and communicational complexity compared with the previous scheme, when GKE is executed among a small group of parties. We also redesign the general party tree for a large number of parties, in which each party is in a different environment such as having large or limited computational resources, electrical power, etc. |
| Rights: | This is the author-created version of Springer, Yvo Desmedt and Atsuko Miyaji, Lecture Notes in Computer Science, 6584/2011, 2011, 236-254. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-21518-6_17 |
| URI: | http://hdl.handle.net/10119/10292 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 15774.pdf | | 385Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
