CASKA-CRT: Chinese Remainder Theorem Empowered Certificateless Aggregate Signcryption Scheme With Key Agreement in IoVs

Abstract

To enhance the privacy of messages in Internet of Vehicles (IoVs), it is critical to preserve the communication security between Road Side Unit (RSU) and numerous vehicles. The primitive of signcryption is introduced to guarantee the confidentiality, integrity and unforgeability of transmitted messages. Nevertheless, the existing signcryption schemes fail to achieve a balance between security and efficiency. In this paper, we construct a Chinese remainder theorem (CRT) empowered certificateless aggregate signcryption scheme with key agreement (CASKA-CRT). As the vehicle joins and leaves dynamically, the proposed scheme can ensure the dynamic security via one modulo division operation. Besides, the certificateless aggregate signcryption and key agreement mechanisms are embedded. The former idea can both address the certificate management and key escrow problems, while the latter technology can create authentication as a premise of secure communication. Based on this construction, the hash-to-group operation and bilinear pairing are avoided, to realize a faster verification with the increased number of messages. Moreover, the security of proposed scheme is proved under the random oracle model. Finally, the performance analysis demonstrates the advantage of CASKA-CRT in terms of security and reliability over related works.