Redesigning Group Key Exchange Protocol based on Bilinear Pairing Suitable for Various Environments

• Desmedt, Yvo

• Miyaji, Atsuko

抄録

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.

Information Security and Cryptology　6th International Conference, Inscrypt 2010, Shanghai, China, October 20-24, 2010, Revised Selected Papers

identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/10292

収録刊行物

• Lecture Notes in Computer Science

  Lecture Notes in Computer Science 6584/2011 236-254, 2011-07-19

  Springer

キーワード

• group key exchange
• pairing
• party tree
• graph theory

詳細情報

• CRID: 1050845762468450688
• NII論文ID: 120003752191
• ISSN: 03029743
• Web Site: http://hdl.handle.net/10119/10292
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • CiNii Articles