Group Key Update Using Binary Tree and Self-Service Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for updating a group key when new members join or existing members leave a group are inefficient, particularly when multiple members join simultaneously, as they either overburden the server or complicate self-updates for group members.
Innovation Solution
A method and apparatus using a binary tree structure to update group keys by designating an update use node based on child node IDs, allowing for self-updates and efficient key transmission, reducing server load and simplifying the update process for group members.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the server calculates and transmits updated keys to all group members, then all members receive the updated key, but the server burden increases greatly
Solution Approach 1:
The group key update process is segmented into two parts: (1) capable members perform self-update by calculating their own updated keys using the binary tree structure and received information, and (2) the server only transmits updated keys to incapable members. This segmentation reduces the server burden while ensuring all members receive updates.
Solution Approach 2:
Capable group members perform self-service by autonomously calculating their updated group keys using the binary tree structure and information received from the server, without requiring the server to calculate and transmit individualized update data to each member.
2Power
If members perform self-update voluntarily, then server burden is reduced, but it is difficult for members to effectively self-update
Solution Approach 1:
The server performs preliminary actions by providing the binary tree structure and necessary key information to capable members before they perform self-update. This preparation makes the self-update process feasible and straightforward for members with sufficient computational capabilities.
Solution Approach 2:
The binary tree structure serves as an intermediary mechanism that enables capable members to derive their updated keys through systematic calculation. The structured approach provided by the binary tree makes the self-update process manageable and effective.
3Adaptability or versatility
If multiple members join simultaneously using traditional methods, then all members can join the group, but repeated key updates occur causing complexity
Solution Approach 1:
Multiple simultaneous member joins are merged into a single batch update operation. The server processes all join requests together, performs one key update operation using the binary tree structure, and transmits the updated key once to all new members, eliminating repeated updates and reducing complexity.
Solution Approach 2:
The system uses periodic batch processing for member joins, where multiple join requests are accumulated and processed together at scheduled intervals or when a threshold is reached, rather than processing each join individually in real-time.
Data Source
AI summary
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.