Abstract

With the development of 5G and the Internet of Things (IoT), mobile terminals are widely used in various applications under multicast scenarios. However, due to the limited computation resources of mobile terminals, reducing the computation cost of members in group key distribution processes of dynamic groups has become an important issue. In this paper, we propose a computation-efficient group key distribution (CEGKD) protocol. First, an improved secret sharing scheme is proposed to construct faster encryption and decryption algorithms. Second, the tree structure of logical key hierarchy (LKH) is employed to implement a simple and effective key-numbering method. Theoretical analysis is given to prove that the proposed protocol meets forward security and backward security. In addition, the experiment results show that the computation cost of CEGKD on the member side is reduced by more than 85% compared with that of the LKH scheme.

Highlights

  • Multicast is a one-to-many communication technology that can reduce the sender load and increase network-bandwidth utilization

  • In this paper, inspired by threshold secret sharing, we propose a computation-efficient group key distribution (CEGKD) protocol based on a new secret sharing scheme

  • logical key hierarchy (LKH) is a centralized group key management scheme based on a logical key tree, which is suitable for managing the group keys of large groups

Read more

Summary

Introduction

Multicast is a one-to-many communication technology that can reduce the sender load and increase network-bandwidth utilization. On the other hand, when a member leaves, members still in the group must be able to efficiently calculate the new key, while the leaving member cannot obtain it, which is called forward security. Besides satisfying these security restrictions, it is necessary to minimize the communication, computation, and storage costs of the rekeying process. Nearly half of the bandwidth consumption is reduced, but the computation cost of the group member to obtain the group key is increased. Some polynomial-based multicast key distribution framework has achieved good results in reducing the overhead of encryption and decryption algorithms [27,28]

Contributions
Related Works
Logical Key Hierarchy
Shamir Threshold Secret-Sharing Scheme
Our Proposed Protocol CEGKD
New Form of Secret Sharing Scheme
Group-Key Distribution Protocol
Key-Numbering Rule
Joining a Group
Leaving a Group
Security Analysis
Efficiency Analysis
Computation Cost
Communication Cost
Storage Cost
Experiments
Analysis
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call