Skip to Main Content
In this paper, we address the problem of key update for secure group communication. We focus on the case where multiple requests for join or leave are received within short intervals of time. We have shown that there exists an optimal tree structure that minimizes the communication complexity of the key update. We introduce and compare several algorithms for simultaneous key update, efficient tree construction, and tree adaptation to variable requests load.