Communication method and communication system using decentralized key managing scheme
Abstract
This record has no abstract on file.
Term
Term ended
Expired 28 December 2024, 1.7 years ago.
- Priority
- Filed
- Granted
- Expired
- Today
19 claims: 10 independent, 9 dependent
- 1通信ネットワーク中で複数のメンバが加入可能なグループを組織し、該グループ内で通信データの暗号化もしくは認証に用いるグループ鍵を共有するとともに、グループ鍵を最上位の根に割り当て、サブグループ鍵を枝の分岐点であるノードに割り当て、各メンバを最下位の部分木の先端である葉に割り当てて、各メンバはグループ鍵及びグループ鍵から自己に至るまでの全てのサブグループ鍵を保持して通信を行う通信方法であって、 あらかじめグループに属する各メンバにはグループ全体の木構造データ及び、グループ鍵、全てのサブグループ鍵を記憶させておき、 新しいメンバの加入を各メンバが加入脱退検知手段により検知すると、 各メンバが、木構造データ更新手段により、加入メンバを所定の規則に従って木構造の葉に割り当て、自己の記憶する木構造データを更新する木構造データ更新ステップ、 各メンバが、キャプテン当否判定手段により、新しい木構造データから所定の規則に従って自己が部分木のキャプテンとなるか否かを判定するキャプテン当否判定ステップ、 該キャプテンが、新鍵生成配布手段により、少なくとも自己の部分木の各メンバとの間で新鍵を生成し配布する新鍵生成配布ステップ の各ステップを含むことを特徴とする非集中型鍵管理方式を用いた通信方法。
- 2前記通信方法における新鍵生成配布ステップが、 該加入メンバと各キャプテンとが、新鍵共有手段により、互いに新しいグループ鍵又はサブグループ鍵の生成情報を通信し、新鍵を生成して共有する新鍵共有ステップ、 各キャプテンが、新鍵配布手段により、新鍵を対応する従前のグループ鍵又はサブグループ鍵で暗号化して部分木の各メンバに配布する新鍵配布ステップ の各ステップからなることを特徴とする 請求項1に記載の非集中型鍵管理方式を用いた通信方法。
- 3前記通信方法における新鍵生成配布ステップが、 加入メンバと最下位のキャプテンが新鍵を共有すると共に、順次下位のキャプテンが1階層上位のキャプテンと新鍵を共有する新鍵共有ステップ、 各キャプテンが、新鍵配布手段により、新鍵を対応する従前のグループ鍵又はサブグループ鍵で暗号化して部分木の各メンバに配布すると共に、下位のキャプテンから順次に、該キャプテンが属する部分木の新鍵で1階層上位の新鍵を暗号化して加入メンバに送信する新鍵配布ステップ の各ステップからなることを特徴とする 請求項1に記載の非集中型鍵管理方式を用いた通信方法。
- 4前記木構造データ更新ステップにおいて、加入メンバを葉に割り当てる所定の規則が、 木構造全体の最下位でかつ最右側のノードにおける最左側の葉、又は最下位でかつ最左側のノードにおける最右側の葉として割り当てる 請求項1ないし3に記載の非集中型鍵管理方式を用いた通信方法。
- 5前記キャプテン当否判定ステップにおいて、キャプテンとなるか否かを判定する所定の規則が、 ある部分木におけるキャプテンとなるメンバは、その部分木の上位側からみて加入メンバがいる側の枝と反対側の枝の葉のメンバから選択する 請求項1ないし4に記載の非集中型鍵管理方式を用いた通信方法。
- 6前記木構造が2分木である 請求項1ないし3に記載の非集中型鍵管理方式を用いた通信方法。
- 7通信ネットワーク中で複数のメンバが加入可能なグループを組織し、該グループ内で通信データの暗号化もしくは認証に用いるグループ鍵を共有するとともに、グループ鍵を最上位の根に割り当て、サブグループ鍵を枝の分岐点であるノードに割り当て、各メンバを最下位の部分木の先端である葉に割り当てて、各メンバはグループ鍵及びグループ鍵から自己に至るまでの全てのサブグループ鍵を保持して通信を行う通信方法であって、 あらかじめグループに属する各メンバにはグループ全体の木構造データ及び、グループ鍵、全てのサブグループ鍵を記憶させておき、 メンバの脱退を各メンバが加入脱退検知手段により検知すると、 各メンバが、キャプテン当否判定手段により、脱退メンバを除いた木構造データから所定の規則に従って自己が部分木のキャプテンとなるか否かを判定するキャプテン当否判定ステップ、 該キャプテンが、新鍵生成配布手段により、少なくとも自己の部分木のメンバ及び他のキャプテンとの間で新鍵を生成し配布する新鍵生成配布ステップ 各メンバが、木構造データ更新手段により、所定の規則に従って脱退メンバの属する部分木のメンバを葉として再割り当てし、自己の記憶する木構造データを更新する木構造データ更新ステップ の各ステップを含むことを特徴とする非集中型鍵管理方式を用いた通信方法。
- 8前記通信方法における新鍵生成配布ステップが、 脱退メンバの生じた最下位の部分木のキャプテンと、脱退メンバの属する部分木のその他全てのキャプテンとが、新鍵共有手段により、互いに新しいグループ鍵又はサブグループ鍵の生成情報を通信し、新鍵を生成して共有する新鍵共有ステップ、 各キャプテンが、新鍵配布手段により、生成された新鍵を1階層下位の従前のサブグループ鍵で暗号化して部分木の各メンバに配布すると共に、脱退メンバの生じた最下位の部分木のキャプテンが、新鍵配布手段により、不足している新鍵をその部分木の従前のサブグループ鍵で暗号化して、当該部分木の各メンバに配布する新鍵配布ステップ の各ステップからなることを特徴とする 請求項7に記載の非集中型鍵管理方式を用いた通信方法。
- 9前記通信方法における新鍵生成配布ステップが、 脱退メンバの生じた最下位の部分木のキャプテンから順次に、下位のキャプテンが1階層上位のキャプテンと新鍵を共有する新鍵共有ステップ、 各キャプテンが、新鍵配布手段により、自己の部分木の各メンバに新鍵を配布すると共に、脱退メンバの生じた部分木のキャプテンが、新鍵配布手段により、不足している新鍵をその部分木の従前のサブグループ鍵で暗号化して、当該部分木の各メンバに配布する新鍵配布ステップ の各ステップからなることを特徴とする 請求項7に記載の非集中型鍵管理方式を用いた通信方法。
- 10前記キャプテン当否判定ステップにおいて、キャプテンとなるか否かを判定する所定の規則が、 ある部分木におけるキャプテンとなるメンバは、その部分木の上位側からみて加入メンバがいる側の枝と反対側の枝の葉のメンバから選択する 請求項7ないし9に記載の非集中型鍵管理方式を用いた通信方法。
- 11前記木構造が2分木である 請求項7ないし10に記載の非集中型鍵管理方式を用いた通信方法。
- 12通信ネットワーク中で複数のメンバが加入可能なグループを組織し、該グループ内で通信データの暗号化もしくは認証に用いるグループ鍵を共有するとともに、グループ鍵を最上位の根に割り当て、サブグループ鍵を枝の分岐点であるノードに割り当て、各メンバを最下位の部分木の先端である葉に割り当てて、各メンバはグループ鍵及びグループ鍵から自己に至るまでの全てのサブグループ鍵を保持して通信を行う通信システムであって、 各メンバとなる端末装置に、 グループ全体の木構造データ及び、グループ鍵、全てのサブグループ鍵を記憶する記憶手段と、 新しいメンバの加入又はメンバの脱退を検知する加入脱退検知手段と、 加入メンバを所定の規則に従って木構造の葉に割り当て、自己の記憶する木構造データを更新するか、又は所定の規則に従って脱退メンバの属する部分木のメンバを葉として再割り当てし、自己の記憶する木構造データを更新するかの少なくともいずれかの処理を行う木構造データ更新手段と、 木構造データから所定の規則に従って自己が部分木のキャプテンとなるか否かを判定するキャプテン当否判定手段と、 キャプテンとなった場合に、少なくとも自己の部分木のメンバとの間で新鍵を生成し配布する新鍵生成配布手段と を備えて構成することを特徴とする 非集中型鍵管理方式を用いた通信システム。
- 13前記通信システムにおける端末装置の新鍵生成配布手段が、 該加入メンバ及びキャプテン間で、互いに新しいグループ鍵又はサブグループ鍵の生成情報を通信し、新鍵を生成して共有する新鍵共有手段と、 キャプテンの時に、新鍵を対応する従前のグループ鍵又はサブグループ鍵で暗号化して部分木の各メンバに配布する新鍵配布手段と からなる請求項12に記載の非集中型鍵管理方式を用いた通信システム。
- 14前記通信システムにおける端末装置の新鍵生成配布手段が、 加入メンバと最下位のキャプテンが新鍵を共有すると共に、順次下位のキャプテンが1階層上位のキャプテンと新鍵を共有する新鍵共有手段と、 キャプテンの時に、新鍵を対応する従前のグループ鍵又はサブグループ鍵で暗号化して部分木の各メンバに配布すると共に、下位のキャプテンから順次に、該キャプテンが属する部分木の新鍵で1階層上位の新鍵を暗号化して加入メンバに送信する新鍵配布手段と からなる請求項12に記載の非集中型鍵管理方式を用いた通信システム。
- 15前記通信システムにおける端末装置の新鍵生成配布手段が、 脱退メンバの生じた最下位の部分木のキャプテンと、脱退メンバの属する部分木のその他全てのキャプテンとが、互いに新しいグループ鍵又はサブグループ鍵の生体情報を通信し、新鍵を生成して共有する新鍵共有手段と、 キャプテンの時に、生成された新鍵を1階層下位の従前のサブグループ鍵で暗号化して部分木の各メンバに配布すると共に、脱退メンバの生じた最下位の部分木のキャプテンが、不足している新鍵をその部分木の従前のサブグループ鍵で暗号化して、当該部分木の各メンバに配布する新鍵配布手段と からなる請求項12に記載の非集中型鍵管理方式を用いた通信システム。
- 16前記通信システムにおける端末装置の新鍵生成配布手段が、 脱退メンバの生じた最下位の部分木のキャプテンから順次に、下位のキャプテンが1階層上位のキャプテンと新鍵を共有する新鍵共有手段と、 キャプテンの時に、新鍵配布手段により、自己の部分木の各メンバに新鍵を配布すると共に、脱退メンバの生じた部分木のキャプテンが、不足している新鍵をその部分木の従前のサブグループ鍵で暗号化して、当該部分木の各メンバに配布する新鍵配布手段と からなる請求項12に記載の非集中型鍵管理方式を用いた通信システム。
- 17前記木構造データ更新手段で用いる加入メンバを葉に割り当てる所定の規則が、 木構造全体の最下位でかつ最右側のノードにおける最左側の葉、又は最下位でかつ最左側のノードにおける最右側の葉として割り当てる 請求項12ないし16に記載の非集中型鍵管理方式を用いた通信システム。
- 18前記キャプテン当否判定手段で用いるキャプテンとなるか否かを判定する所定の規則が、 ある部分木におけるキャプテンとなるメンバは、その部分木の上位側からみて加入メンバがいる側の枝と反対側の枝の葉のメンバから選択する 請求項12ないし17に記載の非集中型鍵管理方式を用いた通信システム。
- 19前記木構造が2分木である 請求項12ないし18に記載の非集中型鍵管理方式を用いた通信システム。
Independent claims19
80 paragraphs, as filed
The present invention relates to a communication method and system in which a group key is shared by members in a group in a communication network and communication encrypted with the key is performed, and particularly relates to a configuration in which the group key is managed by a decentralized key management method.
In recent years, with the spread of mobile phones, research and development of mobile security technology and commercialization have become active. In addition, research on next-generation mobile communication networks that seamlessly integrate radios with various characteristics, including 2G and 3G cellular networks, is progressing. For example, it is disclosed in Non-Patent Document 1 by the inventors of the present invention. To. This next-generation communication network has a function of automatically selecting the optimum radio according to the mobile service to be used, and as disclosed in Non-Patent Document 2, various radios can be flexibly used in the network. An architecture that can be plugged in is assumed.
<nplcit num="1"><text>M. Kuroda, M. Inoue, A. Okubo, T. Sakakura, K. Shimizu, and F. Adachi, Scalable Mobile Ethernet and Fast Vertical Handover, Proc. IEEE Wireless Communications and Networking Conference 2004, Mar. 2004.</text></nplcit><nplcit num="2"><text>M. Yoshida, M. Kuroda, S. Kiyomoto, and T. Tanaka, A SecureService Architecture for Beyond 3G WirelessNetwork, Proc. 6th International Symposium onWireless Personal Multimedia Communications, Vol.2, pp. 579-583, 2003.</text></nplcit>
In the next-generation mobile communication network, in addition to the conventional client-server type service, multiple users can form a dynamic group using various mobile terminals, and members can safely share information with each other. Expectations are also high for group-type services. Functions required to realize such secure group communication include data confidentiality and integrity verification, sender authentication, and member management, but management of group keys shared by group members is also possible. This is a very important research topic.
In a dynamic group where members can join or leave, members who newly join the group (hereinafter referred to as joined members) cannot access the information before joining, and members who leave the group (hereinafter referred to as withdrawn members). It is necessary to update the group key so that the information after withdrawal cannot be accessed. The key management method that has a group key update function is a method that requires a server or wireless base station that centrally manages keys (disclosed in Non-Patent Documents 3 to 11), and a DH key in cooperation with all group members. It can be roughly divided into a method called Contributory Key Agreement (disclosed in Non-Patent Documents 12 to 16) that shares and updates the group key.
As is well known, DH key sharing is a key sharing method developed by Mr. Diffie and Mr. Hermann. In the key sharing method, the discrete logarithm problem is used to use random numbers and secret keys instead of the secret key itself. Send and receive the generated public information (public key). As a result, even if the communication content is eavesdropped by a third party, the private key is not immediately known, and the key information can be shared safely.
<nplcit num="3"><text>H. Harney, C. Muckenhirn, and T. Rivers, Group Key Management Protocol (GKMP) Specification, IETF, RFC 2093, 1997.</text></nplcit><nplcit num="4"><text>H. Harney, C. Muckenhirn, and T. Rivers, Group Key Management Protocol (GKMP) Architecture, IETF, RFC 2094, 1997.</text></nplcit><nplcit num="5"><text>D. Wallner, E. Harder, R. Agee, Key Management for Multicast: Issues and Architectures, IETF, RFC 2627, 1999.</text></nplcit><nplcit num="6"><text>CK Wong, M. Gouda, and S. Lam, Secure Group Communication Using Key Graphs, IEEE / ACM Trans. On Networking, Vol. 8, No. 1, pp. 16-30, 2000.</text></nplcit><nplcit num="7"><text>R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, Multicast Security: A Taxonomy and Efficient Constructions, Proc.IEEE Infocom '99, Vol.2, pp. 708 -716, 1999.</text></nplcit><nplcit num="8"><text>DA McGrew, and AT Sherman, Key Establishment in Large Dynamic Groups Using One-Way Function Trees, IEEE Trans. On Software Engineering, Vol.29, No. 5, pp. 444-458, 2003.</text></nplcit><nplcit num="9"><text>A. Perrig, D. Song, and JD Tygar, ELK: A NewProtocol for Efficient Large-Group Key Distribution, Proc. IEEE Security and Privacy Symposium, pp. 247-262, 2001.</text></nplcit><nplcit num="10"><text>A. Perrig, R. Szewczyk, V. Wen, D. Culler, and JD Tygar, SPINS: Security Protocols for Sensor Networks, Proc. Mobile Computing and Networking 2001, pp. 189-199, 2001.</text></nplcit><nplcit num="11"><text>YW Law, R. Corin, S. Etalle, and PH Hartel, A Formally Verified Decentralized Key Management Architecture for Wireless Sensor Networks, Proc. Personal Wireless Communications 2003, pp. 27-39, 2003.</text></nplcit><nplcit num="12"><text>DG Steer, L. Strawczynski, W. Diffie, and M. Wiener, A Secure Audio Teleconference System, Proc. Advances in Cryptology-CRYPTO '88, pp. 520-528, 1988.</text></nplcit><nplcit num="13"><text>M. Burmester, and Y. Desmedt, A Secure and Efficient Conference Key Distribution System, Proc. Advances in Cryptology-EUROCRYPT '94, pp. 275-286, 1994.</text></nplcit><nplcit num="14"><text>M. Steiner, G. Tsudik, and M. Waidner, Key Agreement in Dynamic Peer Groups, IEEE Trans. On Parallel and Distributed Systems, Vol. 11, No. 8, pp 769-780, 2000.</text></nplcit><nplcit num="15"><text>J. Alves-Foss, An Efficient Secure Authenticated Group Key Exchange Algorithm for Large and Dynamic Groups, Proc. 23rd National Information Systems Security Conference, pp. 254-266, 2000.</text></nplcit><nplcit num="16"><text>Y. Kim, A. Perrig, and G. Tsudik, Simple and Fault-Tolerant Key Agreement for Dynamic Collaborative Groups, ACM Conference on Computer and Communications Security 2000, pp. 235-244, 2000.</text></nplcit>
The former has the possibility that the entity that centrally manages keys becomes a Single Point of Failure, and it is difficult to apply it to serverless group communication such as Ad Hoc networks. The latter is unsuitable for group communication including mobile terminals with poor computing power, because all members of the group need to perform exponentiation calculation when updating the group key.
By the way, as a conventional method of updating a group key, a method of managing keys in a tree structure known as Logical Key Hierarchy (LKH) (disclosed in Non-Patent Documents 5 and 6) is very efficient. However, such a method for centrally managing keys has the above-mentioned problems, and a key management method with less cost is desired when a member joins or leaves.
As patent documents using a key management server, techniques such as those disclosed in Patent Document 17 and Patent Document 18 are known, and Patent Document 17 discloses a method in which a key management server collectively manages. In that case, if the group is large, the cost of updating the key will increase. There is a title. Further, Patent Document 18 separately provides a serve group key management server that manages subgroups, but it is a server that manages keys to the last, and is a method managed by a server at the upper level of the tree structure.
<patcit num="17"><text>Japanese Unexamined Patent Publication No. 9-319673</text></patcit><patcit num="18"><text>Japanese Unexamined Patent Publication No. 2004-023237</text></patcit>
<p> The present invention has been created in view of the above-mentioned prior art, and proposes a decentralized key management method that realizes tree-structured key management only by group members without using a key management server, and is secure. The purpose is to provide a communication method and system that contributes to group communication.</p>
<p> The present invention provides the following communication methods in order to solve the above problems. That is, the invention according to claim 1 organizes a group in which a plurality of members can join in the communication network, shares the group key used for encryption or authentication of communication data within the group, and uses the group key. Assign to the highest root, assign the subgroup key to the node that is the branch point of the branch, assign each member to the leaf that is the tip of the lowest subtree, and each member extends from the group key and group key to itself. It is a communication method that holds all the subgroup keys up to and communicates. Then, each member belonging to the group stores the tree structure data of the entire group, the group key, and all the subgroup keys in advance, and when each member detects the joining of a new member by the joining / withdrawal detecting means, each of the following Including steps.</p><p>(1) A tree structure data update step in which each member assigns a member to a tree structure leaf according to a predetermined rule by means of the tree structure data update means, and updates the tree structure data stored by the member. (2) A captain pass / fail determination step in which a member determines whether or not he / she becomes the captain of a subtree according to a predetermined rule from new tree structure data by the captain pass / fail determination means. (3) A new key generation and distribution step in which the captain generates and distributes a new key with at least each member of his / her subtree by means of a new key generation / distribution means.</p><p> In the invention according to claim 2, the new key generation and distribution step in the communication method according to claim 1 is such that the member and each captain use a new key sharing means to generate new group key or subgroup key information. A new key sharing step that communicates, generates and shares a new key, and each captain encrypts the new key with the corresponding previous group key or subgroup key by the new key distribution means and each member of the subtree. It is characterized by consisting of each step with the new key distribution step to be distributed to.</p><p> In the invention according to claim 3, in the new key generation and distribution step in the communication method of claim 1, the subscribing member and the lowest captain share the new key, and the lower captain sequentially becomes the captain one level higher. In the new key sharing step of sharing the new key, each captain encrypts the new key with the corresponding previous group key or subgroup key by the new key distribution means and distributes it to each member of the subtree, and also lower The feature is that each step consists of a new key distribution step in which the new key of the subtree to which the captain belongs is encrypted with the new key of the subtree to which the captain belongs and is transmitted to the joining member.</p><p> The invention according to claim 4 is a structural data update step of the invention according to claims 1 to 3. In the game, the prescribed rule for assigning members to leaves is to assign them as the leftmost leaf in the lowest and rightmost node of the entire tree structure, or the rightmost leaf in the lowest and leftmost node. It is a feature.</p><p> The invention according to claim 5 has a predetermined rule for determining whether or not to become a captain in the captain validity determination step of the invention according to claims 1 to 3, and the member who becomes a captain in a certain subtree is a member. It is characterized by selecting from the leaf members of the branch on the side opposite to the branch on the side where the joining member is when viewed from the upper side of the subtree.</p><p> The invention according to claim 6 is characterized in that the tree structure is a binary tree.</p><p> The invention according to claim 7 is characterized in that when each member detects the withdrawal of a member by the joining / withdrawal detecting means, each step is included. (1) A captain pass / fail determination step in which each member determines whether or not he / she becomes the captain of a subtree according to a predetermined rule from the tree structure data excluding the withdrawal member by the captain pass / fail determination means. (2) A new key generation and distribution step in which the captain generates and distributes a new key with at least a member of his / her subtree and another captain by a new key generation / distribution means. (3) A tree structure data update step in which each member reassigns the members of the subtree to which the withdrawal member belongs as leaves by the tree structure data update means and updates the tree structure data stored by itself.</p><p> In the invention according to claim 8, in the new key generation and distribution step in the communication method, the captain of the lowest subtree in which the withdrawal member occurs and all the other captains of the subtree to which the withdrawal member belongs are the new keys. A new key sharing step in which new group key or subgroup key generation information is communicated with each other by sharing means to generate and share a new key, and each captain shares the new key generated by the new key distribution means 1 Encrypted with the previous subgroup key at the lower level of the hierarchy and distributed to each member of the subtree, and the captain of the lowest subtree with the withdrawn member uses the new key distribution means to obtain the missing new key. It is characterized by consisting of each step with a new key distribution step of encrypting with the previous subgroup key of the subtree and distributing it to each member of the subtree.</p><p> In the invention according to claim 9, in the new key generation and distribution step in the communication method, the lower captain shares the new key with the captain one level higher in order from the captain of the lowest subtree in which the withdrawal member occurs. The new key sharing step and each captain distribute the new key to each member of his / her subtree by the new key distribution means, and the captain of the subtree with the withdrawal member is insufficient by the new key distribution means. The feature is that the new key is encrypted with the previous subgroup key of the subtree, and each step consists of a new key distribution step of distributing to each member of the subtree.</p><p> The invention according to claim 10 has a predetermined rule for determining whether or not to become a captain in the captain hit / fail determination step, and a member who becomes a captain in a certain subtree is a member who joins when viewed from the upper side of the subtree. It is characterized by selecting from the members of the leaves of the branch on the side where it is and the branch on the opposite side.</p><p> The invention according to claim 11 is a binary tree having a tree structure in the inventions of claims 7 to 10.</p><p> The present invention can provide the following communication systems. That is, according to the invention of claim 12, a plurality of members are added in the communication network. Organize a group that can be entered, share the group key used for encryption or authentication of communication data within the group, assign the group key to the highest root, and assign the subgroup key to the node that is the branch point of the branch. Allocate, assign each member to the leaf that is the tip of the lowest subtree, and provide a communication system in which each member holds and communicates with the group key and all subgroup keys from the group key to itself. ..</p><p> Then, the terminal device as each member is provided with the following means. (1) A storage means for storing tree structure data of the entire group, group keys, and all subgroup keys. (2) Join / withdrawal detection means for detecting the joining or withdrawal of a new member. (3) Assign the joining members to the leaves of the tree structure according to the prescribed rules and update the tree structure data stored by themselves, or reassign the members of the subtree to which the leaving members belong as the leaves according to the prescribed rules and self. A tree structure data updating means that performs at least one of the processes of updating the tree structure data stored in the tree structure data. (4) Captain hit / fail determination means for determining whether or not oneself becomes the captain of a subtree from tree structure data according to a predetermined rule. (5) A new key generation and distribution means that generates and distributes a new key with at least the members of its own subtree when it becomes a captain.</p><p> According to the invention of claim 13, the new key generation and distribution means of the terminal device in the communication system communicates the generation information of the new group key or the subgroup key with each other between the joining member and the captain to generate the new key. It is characterized by consisting of a new key sharing means to share the new key and a new key distribution means to encrypt the new key with the corresponding previous group key or subgroup key and distribute it to each member of the subtree at the time of captain. To do.</p><p> According to the invention described in claim 14, in the new key generation and distribution means of the terminal device in the communication system, the subscriber member and the lowest captain share the new key, and the lower captain sequentially becomes the captain one level higher. A new key sharing means for sharing a new key, and at the time of the captain, the new key is encrypted with the corresponding previous group key or subgroup key and distributed to each member of the subtree, and the lower captain is sequentially added. It is characterized by consisting of a new key distribution means that encrypts the new key one level higher with the new key of the subtree to which the captain belongs and sends it to the joining members.</p><p> In the invention according to claim 15, the new key generation and distribution means of the terminal device in the above-mentioned communication system includes the captain of the lowest subtree in which the withdrawal member occurs and all other captains of the subtree to which the withdrawal member belongs. A new key sharing means that communicates new group key or subgroup key generation information with each other to generate and share a new key, and a previous subgroup key that is one level lower than the generated new key at the time of captain. The key is encrypted with and distributed to each member of the subtree, and the captain of the lowest subtree with the withdrawal member encrypts the missing new key with the previous subgroup key of the subtree. It consists of a new key distribution means to be distributed to each member of the subtree.</p><p> In the invention according to claim 16, the new key generation and distribution means of the terminal device in the communication system sequentially starts with the captain of the lowest subtree in which the withdrawal member occurs, and the lower captain is the captain one level higher and the new key. The new key sharing means to share the new key and the new key distribution means to distribute the new key to each member of the subtree at the time of the captain, and the captain of the subtree with the withdrawal member is lacking. It consists of a new key distribution means that encrypts the key with the previous subgroup key of the subtree and distributes it to each member of the subtree.</p><p> The invention according to claim 17 is that in the communication system of claims 12 to 16, a predetermined rule for assigning a member to a leaf used in the tree structure data updating means is at the lowest level of the entire tree structure. It is characterized in that it is assigned as the leftmost leaf in the rightmost node or the rightmost leaf in the lowest and leftmost node.</p><p> The invention according to claim 18 has a predetermined rule for determining whether or not to be a captain used in the captain hit / fail determination means in the above communication system, and a member who becomes a captain in a certain subtree is from the upper side of the subtree. It is characterized by selecting from the members of the leaves of the branch on the side where the joining member is and the branch on the opposite side.</p><p> The invention according to claim 19 is characterized in that, in the communication system of claims 12 to 18, the tree structure is a binary tree.</p>
<p> The above invention produces the following effects. That is, according to the communication method using the decentralized key management method according to claims 1 to 6, it is possible to provide a serverless and secure key management method for sharing a group key when a member joins, and the cost is high. It also contributes to the suppression of.</p><p> According to the communication method using the decentralized key management method according to claims 7 to 11, it is possible to provide a serverless and secure key management method for sharing a group key when a member leaves, and cost reduction. Also contributes to.</p><p> According to the inventions of claims 12 to 19, it is possible to implement the above communication method and provide a communication system using a decentralized key management method.</p>
<figref num="1">It is a block diagram of the terminal apparatus which comprises the communication system which concerns on this invention.</figref><figref num="2">It is explanatory drawing explaining the relationship of a node and a member of FDLKH.</figref><figref num="3">It is explanatory drawing which generalized the relationship of a node and a member of FDLKH.</figref><figref num="4">It is explanatory drawing explaining the process at the time of joining a member by the method of this invention.</figref><figref num="5">It is explanatory drawing explaining the process at the time of member withdrawal by the method of this invention.</figref><figref num="6">It is a flow chart of the process at the time of member joining by the method of this invention.</figref><figref num="7">It is a flow chart of the process at the time of member withdrawal by the method of this invention.</figref><figref num="8">It is a flow chart of the joining protocol which concerns on 2nd Embodiment of this invention.</figref><figref num="9">It is a flow chart of the joining protocol which concerns on 3rd Example of this invention.</figref><figref num="10">It is a flow chart of the withdrawal protocol which concerns on 4th Example of this invention.</figref><figref num="11">It is a flow chart of the withdrawal protocol which concerns on 5th Example of this invention.</figref><figref num="12">It is a graph which shows the change of the cost of the common key cryptosystem with respect to the number of members in the member addition of FDLKH (dedicated method).</figref><figref num="13">It is a graph which shows the change of the cost of the common key cryptosystem with respect to the number of members in the member addition of FDLKH (distributed method).</figref><figref num="14">It is a graph which shows the change of the cost of the common key cryptosystem with respect to the number of members in the member withdrawal of FDLKH (dedicated method).</figref><figref num="15">It is a graph which shows the change of the cost of the common key cryptosystem with respect to the number of members in the member withdrawal of FDLKH (distributed method).</figref>
Code description
70 Tree structure data update step 71 Captain selection step 72 New key sharing step 73 New key distribution step
Hereinafter, embodiments of the present invention will be described with reference to examples shown in the drawings. The embodiment is not limited to the following.
FIG. 1 is a configuration diagram of a terminal device in the communication system according to the present invention. As shown in the figure, the terminal device (1) is provided with a CPU (10), a network adapter (20) that controls network communication, and a memory (21) that stores data. Such a configuration is provided in a known personal computer, a mobile phone terminal, a mobile information communication terminal, or the like, and the present invention can be implemented in these devices.
Then, in the CPU (10), the processing by the subscription / withdrawal detection unit (11) that detects the subscription / withdrawal of other members forming the group on the network, and the tree structure data for managing the key in the entire group are updated. In addition to the processing by the tree structure data updating unit (12) to be processed, each processing of the captain hit / fail determination unit (13), the new key sharing unit (14), and the new key distribution unit (15) that realizes the method of the present invention is performed. ..
Regarding the process of generating and sharing a key in the present invention, the process of generating and sharing an encryption key using a public key cryptosystem in network communication is well known, and these well-known techniques can be applied.
Next, the concept of the group key according to the present invention will be described. The group key is a common key encryption key shared by all members of the group, and the communication flowing through the group is encrypted by this group key. It is necessary to renew the group key when a member joins or leaves. A tree-structured key management method known as Logical Key Hierarchy (LKH) is very efficient as a group key update method, but it is designed for a centralized key management server.
Therefore, the present invention proposes a decentralized key management method that realizes tree-structured key management only by group members without using a key management server. Hereinafter, the proposed method will be referred to as FDLKH (Fully Decentralized Key Management Scheme on Logical Key Hierarchy). The essence of LKH is to assign group members to logical tree leaves, divide them into subgroup groups by subtree, and distribute the keys used for group key updates to each subgroup by the management server. , The cost of encryption required for one group key update is to be suppressed from O (n) to O (log n) for the number of members n.
In FDLKH according to the present invention, members are divided into subgroups using a binary tree, and one member is selected as a representative from each subgroup instead of the key management server, and is in charge of DH key sharing and key distribution. As a result, the encryption cost is O (log n) as in LKH, and the number of keys in the entire system is about half that of LKH.
Next, FIG. 2 is an explanatory diagram showing a part of a binary tree used in FDLKH. Each node (30) to (33) of the tree is the level (34) l (l = 0,1,2, ...) of the tree and the position m (0 m 2) at that level (34).<sup>l</sup>Expressed as <l, m> using -1). Therefore, the node (31) at position 0 (far left) at level 1 is <1,0>.
Group members are assigned to nodes that have no children (ie leaves, leaves). Hereinafter, such an allocation is expressed as "a member occupies a node". Occupy node <l, m> The members that have are expressed as M <l, m>. For example, the leaf member of node <4,4> is M <5,8> (35). And M <5,9> (36).
A key is assigned to a node that is not occupied by a member, and the key assigned to a node <l, m> is represented as K <l, m>. This K <l, m> is shared among the members belonging to the subtree T <l, m> rooted at the node <l, m>. For example, the key shared among the members belonging to the subtree T <4,4> (37) rooted at node <4,4> (33) in FIG. 2 is K <4,4>, and the present invention So we call this a subgroup key.
Note that K <0,0> is shared by all members, that is, this is the group key. In the present invention, the member holds the group key, which is the highest key, and the subgroup key in each layer. That is, members M <5,8> (35) and M <5,9> (36) belong to the subtree T <4,4> and share the key K <4,4>, as well as these. Members also belong to subtrees T <3,2>, T <2,1>, T <1,0>, T <0,0> (not shown), so the keys held by both members are K <4,4. >, K <3,2>, K <2,1>, K <1,0>, K <0,0>, a total of five. That is, a member has all the keys on the path from its parent node (one level higher node) to the root node <0,0> (highest node).
Figure 3 is a generalization of the binary tree starting from the member M <l, m> (40) that occupies the node <l, m>. The parent node of M <l, m> is represented by <l-1, [m / 2]> (41), and the sibling members (members belonging to the same parent node) are M <l, m + (-1).<sup>m</sup>> (42). All ancestor nodes (43) from the parent node to the root node are <li, [m / 2<sup>i</sup>]> (i = 1, , l) can be generalized. Therefore, the subtree to which M <l, m> belongs and the key it owns are T <li, [m / 2 respectively.<sup>i</sup>]>, K <li, [m / 2<sup>i</sup>]> Can be expressed.
In the present invention, when a member joins or leaves a group, one member is selected as a representative for each subtree rooted at a node that requires key update, and those representatives process the key update. I took charge of it. As a result, the key management that has conventionally used the key management server can be distributed to the representative members for processing. Such a member is called a "captain", and the captain representing the subtree T <l, m> is represented as C <l, m>.
The captain is in charge of key sharing and key distribution processing on behalf of the node-based subtree that requires key operation when a member joins or leaves. When joining a member, each captain of the subtree and the joining member share the DH key, and when leaving the member, the captains share the DH key. As a result, each captain distributes the shared key to the members of the subtree. When M <l, m> joins or leaves, there are l nodes that require key manipulation, so l members are selected as captains.
The member who becomes the captain of a subtree is selected from the descendants of the branch on the side where the joining / leaving member is and the branch on the opposite side when viewed from the root node of the subtree. Figure 4 shows an example in which member M <3,3> (50) joins, and captain C <2,1> of subtree T <2,1> has a branch on the opposite side of node <2,1>. The descendant member M <3,2> (51) is selected. Similarly, captain C <1,0> of subtree T <1,0> has member M <3,0> (52), and captain C <of subtree (whole tree structure) T <0,0>. Member M <3,4> (53) is selected for 0,0>.
Similarly, Figure 5 shows an example of member M <3,0> (60) leaving, member M <3,1> (61), M <3,3> (62), M <2,3>. (63) becomes captains C <2,0>, C <1,0>, and C <0,0>, respectively. Next, consider the case where the subtree has multiple members who are candidates for the captain. For example, in T <1,0> in FIG. 4, M <3,0> (52) and M <3,1> (54), and in T <0,0>, M <3,4> (53). M <3,5> (55) and M <2,3> (56) are candidates for captains.
In the present invention, each member determines whether or not he / she is the captain by the captain hit / miss determination unit (13) by a common selection algorithm. The simplest selection algorithm is to refer to the tree structure data that each member always stores in the memory (21), and according to the above, the branch on the side where the joining / leaving member is seen from the root node of the subtree. It is determined in order whether it is a descendant of the branch on the opposite side, or if there are multiple descendants, it is the leftmost member, and if all of them are satisfied, the self is determined to be the captain of the subtree.
This method is a method of fixing the member who becomes the captain for each subtree, and is suitable for a group in which there is a difference in the computing power of the members and the processing is to be concentrated to some extent on the member having a high computing power. Therefore, for example, the members may be ranked in advance according to the calculation power, and when the rank of the self is the highest, the self may be determined as the captain.
Another method is a variable method in which the role of the captain is carried around among the members who are candidates for the captain. This method is suitable for groups in which members are on an equal footing with each other and want to flatten the processing load. Therefore, a selection algorithm such as moving the captain around in the subtree from left to right can be used.
In the decentralized key management method of the present invention, when a member joins or leaves, the tree structure data is updated as follows. The update of the tree structure data is processed by the method of rewriting the data in the memory (21) in the tree structure data update unit (12) of the CPU (10).
That is, in the present invention, all members of the group share information on the binary tree. When a member joins or leaves, each member updates the shape of the binary tree. When joining the members shown in FIG. 4, the joining member (50) has the lowest level in the binary tree and joins as the right child of the leftmost node (57). This is the rule in this embodiment, and conversely, any predetermined rule can be used, such as joining as the left child (or the right child) of the rightmost node <2,3>. In Fig. 4, the joining members are M <3,3>. With the addition of M <3,3>, M <2,1> that occupied node <2,1> moves to the lower layer, and the left child M <3, of node <2,1>. 2>.
Member withdrawal can occur at any node in the binary tree. In Fig. 5, with the withdrawal of M <3,0> (60), M <3,1> (61), which was a sibling member of M <3,0> (60), moved to the upper layer and became a parent. It occupies node <2,0> and becomes M <2,0> (64). If the sibling node of the withdrawing member is not occupied by the member (for example, M <2, 3> (63) in Fig. 5 is withdrawn), move the subtree rooted at that sibling node to the upper layer and subtree. Update the name of the descendant node of. That is, let T <2,2> be T <1,1>.
As described above, when each member detects the joining or leaving of a member from the network by the joining / leaving detection unit (11), in the case of a joining member, the level is the lowest in the binary tree and the leftmost side according to the above rules. When the tree structure data is updated by joining as the right child of the node (57) of, and the member leaves, the sibling member is moved up one level, or when the sibling node is not occupied by the member, The tree structure data is updated by moving the subtree rooted at the sibling node to the upper layer.
For joining members, the captain of the subtree rooted at the parent node of the joining member The information of the binary tree is transmitted, and the joining member stores it in the memory (21). Also, if the number of members before joining is a power of 2 and a complete binary tree is formed, a new root node <0,0> is created and the original root node is moved to <1,0>. Then, the names of the descendant nodes under <1, 0> may be updated so that the joining member is the right child M <1, 1> of the root node.
The present invention is characterized in that the captain generates a group key and a subgroup key and distributes them to each member without using a conventional key management server, and the mode of generation and distribution is arbitrary by a new key generation and distribution means. Can be determined. When a member joins or leaves, the key assigned to the binary tree node is generated, changed, or destroyed in order to update the group key. These three processes are collectively called "key operation".
The nodes that require key operations when joining or leaving a member are all ancestor nodes from the parent node of the joining or leaving member to the root node. <2,1> in the member subscription example in Figure 4 , <1,0>, <0,0> are the nodes that require key manipulation. Here, the key for node <2,1> is newly generated. In the example of member withdrawal in Fig. 5, <2,0>, <1,0>, <0,0> are the nodes that require key operation. At this point, the key for node <2,0> is destroyed.
Key destruction does not require cooperation with other members, and each member with the key to be destroyed performs processing. Cooperation with other members is required for key generation / modification. Generally, when M <l, m> joins a group, the nodes that need to generate / change keys are <li, [m / 2].<sup>i</sup>]> (i = 1, , l) can be expressed. On the other hand, when M <l, m> leaves the group, the nodes that need to change the key are <lj, [m / 2] excluding the parent node whose key is destroyed.<sup>j</sup>]> (j = 1, , l) can be expressed.
Hereinafter, as embodiments, two cases when a member joins and two cases when a member leaves the member will be described in Examples 2 to 5, respectively.
First, an embodiment in which a new key generation and distribution means at the time of member subscription is configured by a new key sharing unit (14) and a new key distribution unit (15) of the CPU (10) and the subscription protocol shown in FIG. 6 is processed. To explain. (This method is called FDLKH's dedicated method.) As described above, when the member (50) joins, when the member (11) detects it, the tree structure data update unit (12) performs the tree structure data update process (70) in each member. Next, each member performs the processing of the captain hit / fail determination unit (13), so that the captain in the tree structure is selected (71). The captain (51) sends the tree structure data to the member (50).
Then, the process proceeds to the new key sharing process (72). Here, DH key sharing is used to generate / change a new key. When joining a member, the joining member and each captain share the DH key. Each captain inputs the value shared by the DH key share into the cryptographically secure one-way hash function h, and assigns the resulting output to the root node of the subtree as a symmetric key cryptographic key.
In FIG. 4, the joining member M <3,3> and the members M <3,2>, M <3,0>, M <3,4> selected as captains are the public information prime numbers p and Zp.<sup>*</sup>Source g of, and secret random number X of each member<sub>M <l, m></sub> Z<sub>p-1</sub>The following is calculated by the processing of the new key sharing unit (14) using. (Number 1) Y<sub>M <l, m></sub>= g<sup>XM <l, m></sup> mod p
M <3,3> and each captain M <3,2>, M <3,0>, M <3,4> send the result of Equation 1 as follows. At this time, it is sent by unicast or multicast, but it is a man-in-the-middle attack. In order to prevent this, it is necessary to add a digital signature or the like. Unicast, multicast transmission methods, and digital signature addition technologies are well known.
M <3,3> [M <3,2>, M <3,0>, M <3,4>]: Y<sub>M <3,3></sub>M <3,2> M <3,3>: Y<sub>M <3,2></sub>M <3,0> M <3,3>: Y<sub>M <3,0></sub>M <3,4> M <3,3>: Y<sub>M <3,4></sub> In the above, A B: X indicates that A transmits data X to B.
When each member receives the result of Equation 1 in the new key sharing unit (14), the power remainder operation of DH key sharing is performed, and the value of the result is input to the hash function h for calculation. As a result, M <3,3> and M <3,2>, M <3,0>, M <3,4> can share the following keys, respectively. K'<2,1> = h (g)<sup>XM <3,3> XM <3,2></sup> mod p) K'<1,0> = h (g)<sup>XM <3,3> XM <3,0></sup> mod p) K'<0,0> = h (g)<sup>XM <3,3> XM <3,4></sup> mod p)
When the above new key sharing process (72) is completed, the captain then performs a new key distribution process (73) for distributing the shared new key to other members of the subtree by the new key distribution unit (15). .. When joining a member, the new key is encrypted using the old key before joining and distributed to the members of the subtree.
In Figure 4, M <3,0> (52) and M <3,4> (53), which represent subtrees, old the new keys K'<1,0> and K'<0,0>, respectively. Encrypt with keys K <1,0> and K <0,0> and distribute to each subtree. That is, M <3,0> T <1,0>: E (K <1,0>, K'<1,0>) M <3,4> T <0,0>: E (K <0,0>, K'<0,0>) Here, E (K, X) represents the ciphertext of data X by the key K of symmetric key cryptography. When the new key is distributed, each member of the group decrypts the new key and assigns it to the appropriate node to update all subgroup and group keys. Communication within the group is encrypted with the new group key.
Figure 8 shows a processing flow chart that generalizes the above subscription protocol. In FIG. 8, 1 to 6 are cases where l = 1, 7 to 13 are cases where l is 2 or more, tree structure data update in 2 and 8 (70), and captain selection in 3 and 9 (71). , 4 and 10 are the processes of sharing the new key (72), and 5 to 6 and 11 to 13 are the processes of distributing the new key (73).
Another example of the new key sharing process (72) and the new key distribution process (73) at the time of joining a member is shown below. (This method is called the FDLKH distributed method.) First, in the new key sharing process (72), the joining members M <3,3> (50) are the captains M <3,2>, M <3,0>, M <3,4 as in the second embodiment. Instead of sharing the key with>, the joining member M <3,3> (50) shares the new key with the lowest captain M <3,2> (51), and then that captain M <3, 2> (51) and M <3,0> (52), M <3,0> (52) and M <3,4> (53) share the new key in sequence.
That is, M <3,3> M <3,2>: K'<2,1> M <3,2> M <3,0>: K'<1,0> M <3,0> M <3,4>: K'<0,0> ( indicates sharing) The subgroup key and group key are shared between each member.
Then, in the new key distribution process (73), as in the second embodiment, M <3,0> T <1,0>: E (K <1,0>, K'<1,0>) M <3,4> T <0,0>: E (K <0,0>, K'<0,0>) As the captain distributes the new key to the subtree. Further, in the new key sharing process (72) of this embodiment, since the joining member M <3,3> receives only K'<2,1>, the members M <3,2> (51) and M <3,0> (52) encrypts the new key one higher with the lower key and configures it to be transmitted sequentially. That is, M <3,2> M <3,3>: E (K'<2,1>, K'<1,0>) M <3,0> M <3,3>: E (K'<1,0>, K'<0,0>) Is performed together with the new key distribution process (73). As a result, all the subgroup keys and group keys are distributed to the joining members (50), and each member can update the keys.
Figure 9 shows a processing flow chart that generalizes the above subscription protocol. In FIG. 9, 1 to 6 are cases where l = 1, 7 to 15 are cases where l is 2 or more, tree structure data update in 2 and 8 (70), and captain selection in 3 and 9 (71). , 4 and 10 to 11 are the processes of sharing the new key (72), and 5 to 6 and 12 to 15 are the processes of distributing the new key (73).
Next, the process (dedicated method) when the member corresponding to the second embodiment leaves is described. Figure 7 shows the withdrawal protocol when a member leaves. As described above, when the member (60) withdraws, when the member (60) detects it, the captain in the tree structure selects (80) by performing the processing of the captain hit / fail determination unit (13). Will be done.
Then, the process proceeds to the new key sharing process (81). Here, DH key sharing is used to generate / change a new key. When joining a member, the joining member and each captain share the DH key. Each captain inputs the value shared by the DH key share into the cryptographically secure one-way hash function h, and assigns the resulting output to the root node of the subtree as a symmetric key cryptographic key.
In the example of member withdrawal in FIG. 5, M <3,1> (61) selected as the captain of the subtree T <2,0> and M <3,3> (62) selected as the other captains. ), M <2,3> (63) sends the result of the above equation 1 as follows. M <3,1> [M <3,3>, M <2,3>]: Y<sub>M <3,1></sub>M <3,3> M <3,1>: Y<sub>M <3,3></sub>M <2,3> M <3,1>: Y<sub>M <2,3></sub>
When each member receives the result of Equation 1 in the new key sharing unit (14), the power remainder operation of DH key sharing is performed, and the value of the result is input to the hash function h for calculation. As a result, M <3,1>, M <3,3>, and M <2,3> can share the following keys, respectively. K'<1,0> = h (g)<sup>XM <3,1> XM <3,3></sup> mod p) K'<0,0> = h (g)<sup>XM <3,1> XM <2,3></sup> mod p)
Next, the new key distribution process (82) is performed by the new key distribution unit (15). When leaving a member, the new key is encrypted using the key of the node one layer below the root node of the subtree and distributed to the members of the subtree. In addition, using this new distributed key, the captain of the subtree rooted at the parent node of the leaving member encrypts and distributes the key that is missing in each subtree.
In Figure 5, M <3,3> and M <2,3> each have new keys K'<1,0>, K'<0,0> and keys K <2,1>, K <1. , Encrypt with 1> and distribute to each subtree. That is, M <3,3> T <2,1>: E (K <2,1>, K'<1,0>) M <2,3> T <1,1>: E (K <1,1>, K'<0,0>) Then, the key K'<0,0> that M <3,1> lacks in the subtree T <1,0> is encrypted and distributed using the previously distributed K'<1,0>. .. That is, M <3,1> T <1,0>: E (K'<1,0>, K'<0,0>) Distribute as.
Then, after the key is distributed, each member of the group decrypts the new key, assigns it to the corresponding node, and updates the key. Further, each member performs the tree structure data update process (83) by the tree structure data update unit (12), and completes the withdrawal process.
Figure 10 shows a processing flow diagram that generalizes the above withdrawal protocol. In FIG. 10, 1 to 3 are cases where l = 1, 4 to 10 are cases where l = 2, and 11 to 18 are cases where l is 3 or more. Then, when l = 1, it is the process of deleting the root node and updating the name of the subtree. In other cases, 5 and 12 are the captain's selection (80), and 6 and 13 are the new keys. Sharing (81), 7-9 and 14-17 are new key distribution (82), and 10 and 18 are tree structure data update (83).
As another protocol (distributed method) when a member leaves, it can be configured as follows. This is a method corresponding to the subscription protocol shown in Example 3. In the fourth embodiment, the new key sharing unit (14) has M <3,1> (61), and M <3,3> (62) and M <2,3> (63) have K'<. 1,0> and K'<0,0> were shared, but in this example, M <3,1> (61) and M <3,3> (62) set K'<1,0>. , M <3,3> (62) and M <2,3> (63) share K'<0,0>.
Then, in the new key distribution process (82), M <3,3> (62) applies the new key K'<1,0> encrypted with K <2,1> to the subtree T <2,1>. M <2,3> (63) sends the new key K'<0,0> encrypted with K <1,1> to the subtree T <1,1>, respectively. Furthermore, M <3,3> (62) encrypts the new key K'<0,0> with K'<1,0> and sends it to the subtree T <1,0>.
Figure 11 shows a processing flow diagram that generalizes the above withdrawal protocol. In FIG. 11, 1 to 3 are cases where l = 1, 4 to 10 are cases where l = 2, and 11 to 18 are cases where l is 3 or more. Then, when l = 1, it is the process of deleting the root node and updating the name of the subtree. In other cases, 5 and 12 are the captain's selection (80), and 6 and 13 are the new keys. Sharing (81), 7-9 and 14-17 are new key distribution (82), and 10 and 18 are tree structure data update (83).
Evaluation experiment
Next, the results of an evaluation experiment of FDLKH according to the present invention are shown. As an experiment, the number of keys and the cost of updating the group key at the time of joining / leaving a member (number of times of DH key sharing, number of times of encryption / decryption by common key cryptography) are compared. The costs of two key management methods (Flat, LKH) using a key management server that centrally manages keys for comparison are also shown. Here, Flat refers to a star-type naive method in which an individual common key (hereinafter referred to as an individual key) is shared between the key management server and members, and no other hierarchical key is assigned. LKH also refers to the method shown as a conventional technique in which individual keys are shared between the key management server and members, and the keys for group key update are managed in a tree structure.
For simplification of evaluation, the frequency of the key tree used in LKH (the number of children that each node has) is set to 2, and for both LKH and FDLKH, the number of members n after joining or before leaving is a power of 2. The key tree is a complete binary tree. At this time, if the joining / leaving member is M <l, m>, l = log<sub>2</sub>n holds.
Table 1 shows the total number of key types for the entire system in the three methods of Flat, LKH, and FDLKH, and the number of keys held by one member. Since FDLKH does not use a key management server and therefore does not have individual keys for each member, the number of keys per member is one less than that of LKH, and the total number of types of keys is about half that of LKH.
<tables num="1"><img file="JP4654371B2_D0001.tif" /></tables>
Next, Table 2 shows the costs for members to join. The Regular members in Table 2 are It shows the other members excluding the captain and the joining members, and the number of times is expressed per node. When M <l, m> joins a group, the joining member (newcomer) decrypts l times with an individual key, whereas in FDLKH, the joining member and each captain share a total of l DH keys. The FDLKH according to the present invention is a method that does not require a key management server, and instead of being serverless, the amount of calculation of subscribed members is increased as compared with LKH. However, Flat and LKH require a separate cost for sharing individual keys between the key server and members, and the overall cost is lower for FDLKH. Further, it is shown that the distributed method is a method in which the processing in the case of the join / withdrawal protocol, which is biased to one member, is further decentralized as compared with the dedicated method.
<tables num="2"><img file="JP4654371B2_D0002.tif" /></tables>
The average number of member decryptions is 2 or less in LKH. Similarly for FDLKH, captains and members The average number of decryptions of regular members other than withdrawal members is 2 or less. In LKH, the key management server is encrypted 2 liters, half of which is encrypted for key distribution to subtrees. In FDLKH (dedicated method), each captain performs encryption for this key distribution once (a total of l-1 times). The average number of decodings of the captain is (0 + 1 + ... + l-1) / l = (l-1) / 2. FIG. 12 shows the change in the cost (sum of the number of encryptions and the number of decryptions) of the common key cryptosystem with respect to the number of members in each member subscription of FDLKH (dedicated method) and FIG. 13 shows FDLKH (distributed method). ..
Next, consider the cost of withdrawing from a member. When M <l, m> leaves the group, as shown in Table 3, in the Flat method, the key management server encrypts the new group key with n-1 individual keys other than the leaving member (seceder). It needs to be distributed to each member, and its scalability is low. LKH has introduced a tree structure for key management, and the number of encryptions of the key management server is limited to 2l.
In FDLKH, the captain of the subtree rooted at the parent node of the leaving member performs l-1 times of DH key sharing and l-2 times of encryption for key distribution. Each other captain performs one DH key sharing and one encryption (a total of l-1 times). The average number of decryptions of the captain is (0 + 1 + ... + l-2) / (l-1) = (l-2) / 2. FIG. 14 shows the change in the cost of the common key cryptosystem with respect to the number of members in the member withdrawal of FDLKH (dedicated method) and FIG. 15 shows the FDLKH (distributed method). Buddy captain also indicates the captain closest to the withdrawal member (M <3,1> (61) in Example 5).
<tables num="3"><img file="JP4654371B2_D0003.tif" /></tables>
Every citation, both waysCites: the store holds 7 of 8
| Document | Relation | Office | Cited during |
|---|---|---|---|
| JP2001352321A | Cites | Japan | Examiner |
| US6049878A | Cites | United States of America | Examiner |
| JPH11187013A | Cites | Japan | Examiner |
| JPH1195658A | Cites | Japan | Examiner |
| JP1195658A | Cites | Japan | – |
| JP11187013A | Cites | Japan | – |
| JP2001352321A | Cites | Japan | – |
| KIM Y., et al.,Tree-Based Group Key Agreement,ACM Transactions on Information and System Security,2004年 2月,Vol.7 No.1,p.60-96 | Non-patent | – | – |
5 members in 3 offices
Priority claims9
| Document | Office | Kind | Date |
|---|---|---|---|
| 2004168682 | Japan | A | |
| 2004168682 | Japan | A | |
| 2004168682 | Japan | – | |
| 2004019633 | Japan | W | |
| 2004019633 | Japan | W | |
| 20042004168682 | – | – | – |
| 2004019633 | – | – | – |
| JP20040168682 | – | – | – |
| WO2004JP19633 | – | – | – |
Members5
| Document | Office | Kind | |
|---|---|---|---|
| WO2005122464A1 | World Intellectual Property Organization (WIPO) | A1 | |
| JPWO2005122464A1 | Japan | A1 | |
| US2008165974A1 | United States of America | A1 | |
| JP4654371B2This record | Japan | B2 | |
| US8249258B2 | United States of America | B2 |
16 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Cancellation because of no payment of annual feesLAPS | LAPS | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Written notification of registration of transferJAPANESE INTERMEDIATE CODE: R350R350 | R350 | |
| Written request for registration of change of nameJAPANESE INTERMEDIATE CODE: R313533S533 | S533 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Receipt of annual feesJAPANESE INTERMEDIATE CODE: R250R250 | R250 | |
| Renewal fee payment (event date is renewal date of database)FPAY | FPAY | |
| Certificate of patent or registration of utility modelJAPANESE INTERMEDIATE CODE: R150R150 | R150 | |
| First payment of annual fees (during grant procedure)JAPANESE INTERMEDIATE CODE: A61A61 | A61 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Written decision to grant a patent or to grant a registration (utility model)JAPANESE INTERMEDIATE CODE: A01A01 | A01 | |
| Decision of grant or rejection writtenTRDD | TRDD | |
| Written request to apply exceptions to lack of novelty of inventionJAPANESE INTERMEDIATE CODE: A80A80 | A80 | |
| Written request to apply exceptions to lack of novelty of inventionJAPANESE INTERMEDIATE CODE: A801A80 | A80 | |
| Notification of reasons for refusalJAPANESE INTERMEDIATE CODE: A131A131 | A131 |
Numbers
- Publication
- 4654371
- Publication, DOCDB
- 4654371
- Publication, EPODOC
- JP4654371B
- Application
- 2006514407
- Application, DOCDB
- 2006514407
- Application, EPODOC
- JP20060514407
Titles2
- Japanese
- 非集中型鍵管理方式を用いた通信方法及び通信システム
- English
- Communication method and communication system using decentralized key management method
Classification
- CPC, 3
- H04L9/0891
- H04L9/0836
- H04L2209/80
- IPC, 1
- H04L9 08