# US 2008/0075286 A1 · Method and apparatus for updating a group key

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0075286 A1
- Document ID: US20080075286A1
- Status: Published application
- Kind: A1
- Application number: 11/819,604
- Filed: 2007-06-28
- Published: 2008-03-27
- Earliest claimed: 2006-09-27
- Assignees: Samsung Electronics Co., Ltd.
- Inventors: Dae Youb Kim; Mi Suk Huh; Tae-Chul Jung; Hwan Joon Kim
- Web page: https://patentgrep.com/patent/US20080075286A1

## CPC

- H04L 9/0836: {using tree structure or hierarchical structure}
- H04L 9/0891: {Revocation or update of secret information, e.g. encryption key update or rekeying}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method and apparatus for updating a group key of a group corresponding to a binary tree are provided. The method includes updating keys of leaf nodes that correspond to new members, in response to a join of at least two new members joining the group; determining whether both of two child nodes of a single ancestor node are updated when updating a key of the single ancestor node of the leaf nodes; establishing one of the two child nodes as an update use node when both the two child nodes are updated; and updating a key of the ancestor node using the updating node. Thus, the group key may be effectively updated with respect to multi-join.

## Claims

### Claim 1

A method of updating a group key of a group which corresponds to a binary tree, the method comprising the steps of:
updating keys of leaf nodes which correspond to new members, in response to a join of at least two new members joining the group;
determining whether both of two child nodes of a single ancestor node are updated when updating a key of the single ancestor node of the leaf nodes;
establishing one of the two child nodes as an update use node when both of the two child nodes are updated; and
updating a key of the ancestor node using the updating node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the at least two new members join the group via a batch processing.

### Claim 3 (depends on 1)

The method of claim 1, wherein the establishing of the one of the two child nodes establishes one of the two child nodes as the updating node after comparing node identification (ID) numbers of the two child nodes.

### Claim 4 (depends on 1)

The method of claim 1, further comprising the step of:
encrypting the key of the ancestor node for transmittal to a group member corresponding to a node other than the update use node.

### Claim 5 (depends on 4)

The method of claim 4, wherein the encrypting of the key of the ancestor node further comprises transmitting the key of the ancestor node to the group member corresponding to the node other than the update use node.

### Claim 6 (depends on 1)

The method of claim 1, wherein the updating of the key of the ancestor node establishes an output of a one-way function with respect to the key of the update use node as the key of the ancestor node.

### Claim 7 (depends on 6)

The method of claim 6, wherein the one-way function receives the key of the update use node and update information.

### Claim 8 (depends on 1)

The method of claim 1, wherein the leaf nodes that correspond to the new members are respectively generated by splitting at least one leaf node of the binary tree, the split node having a node ID number that is a minimum or a maximum when the binary tree is a complete binary tree.

### Claim 9 (depends on 1)

The method of claim 1, wherein the leaf nodes that correspond to the new members are respectively generated by splitting at least one leaf node having a node ID number that is a minimum or a maximum, from node IDs where a depth of the leaf nodes is minimum, when the binary tree is not a complete binary tree.

### Claim 10 (depends on 1)

The method of claim 1, wherein the updating of the keys of the leaf nodes corresponding to the new members establishes a member key of the new members as the keys of the leaf nodes.

### Claim 11

A computer-readable storage medium storing a program for implementing a method of updating a group key of a group which corresponds to a binary tree, comprising:
a first set of instructions for updating keys of leaf nodes corresponding to new members in response to a join of at least two new members joining the group;
a second set of instructions for determining whether both of two child nodes of a single ancestor node are updated when updating a key of the ancestor node of the leaf nodes;
a third set of instruction for establishing one of the two child nodes as an update use node when both the two child nodes are updated; and
a third set of instructions for updating a key of the ancestor node using the updating node.

### Claim 12

An apparatus for updating a group key of a group corresponding to a binary tree, the apparatus comprising:
an update determination unit for determining whether two child nodes of a single ancestor node are both updated when updating a key of the ancestor node of the leaf nodes, in response to at least two new members joining the group;
an update use node determination unit for determining one of the two child nodes as the update use node when the two child nodes are both updated; and
a key update unit for updating the key of the ancestor node using the update use node.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the at least two new members join the group via a batch processing.

### Claim 14 (depends on 12)

The apparatus of claim 12, wherein the update use node determination unit determines one of the two child nodes as the updating node after comparing node ID numbers of the two child nodes.

### Claim 15 (depends on 12)

The apparatus of claim 12, further comprising:
a key transmitting unit for encrypting the key of the ancestor node for transmittal to a group member corresponding to a node other than the update use node.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein the key transmitting unit encrypts the key of the ancestor node and transmits the key of the ancestor node to a node other than the update use node.

### Claim 17 (depends on 12)

The apparatus of claim 12, wherein the key update unit establishes an output of a one-way function with respect to the key of the update use node as the key of the ancestor node.

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein the one-way function receives the key of the update use node and update information.

### Claim 19 (depends on 12)

The apparatus of claim 12, wherein the leaf nodes, having a key that is updated, are respectively generated by splitting at least one leaf node of the binary tree having a node ID number that is a minimum or a maximum, when the binary tree is a complete binary tree.

### Claim 20 (depends on 12)

The apparatus of claim 12, wherein the leaf nodes, having the key that is updated, are respectively generated by splitting at least one leaf node, having a node ID number that is a minimum or a maximum from node IDs where a depth of the leaf nodes is minimum, when the binary tree is not a complete binary tree.

### Claim 21 (depends on 12)

The apparatus of claim 12, wherein the leaf nodes having the key that is updated, establishes a member key of the new member as the keys of the leaf nodes.
