Efficient Re-Keying Scheme for Group Key Distribution

In this paper, we propose a communication-efficient re-keying scheme by using a polynomial-based efficient code method. Compared with the previous schemes, the re-keying cost is significantly reduced, since no extra re-keying message header is needed. In addition, the computation overhead is also lightweight since only 2logn hash operations are required for each re-keying. Therefore, the proposed scheme is more suitable for deploying in the group application scenarios with both high dynamic memberships and limited communication channel capacity.