An Efficient and Fault-Tolerant Privacy-Preserving D2D Group Communication

Abstract

Device-to-Device (D2D) communications and the fostered services have been expected to play a key role in the next generation mobile communication networks (5G) and the Internet of Things (IoT) ecosystems. D2D Group Communications (D2DGCs) push forward the technology of two-device communications to that for group-of-device communications. However, they also expose new security threats and raise great privacy concern. Resource-and-battery constraints in the terminal devices further amplify the challenges of designing secure D2DGC. Existent Privacy-Preserving Authenticated Key Agreement (PPAKA) schemes for D2DGC are far from being practical in terms of their computational complexities and weak fault-tolerance. This paper, based on the Modified Computational Diffie-Hellman Problem (MCDHP) and the proposed Certificate-Less Aggregate Signature (CLAS) scheme, proposes a new Privacy-
Preserving Authenticated Key Agreement (PPAKA) scheme which greatly improves the computational performance, the communication performance, and the fault tolerance. The improvements are amplified as the number of devices in a group increases. The analysis shows that that, even for the smallest group of two devices, a device in our scheme only demands 4% the computational complexity of Wang-Yan’s PPAKA-Identity-Based Signature scheme, which is the state-of-the-art scheme for privacy-preserving D2DGC.