期刊
IEEE SYSTEMS JOURNAL
卷 15, 期 1, 页码 245-256出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSYST.2020.2966526
关键词
Certificateless aggregate signature (CLAS); conditional privacy preserving; full aggregation; intelligent transportation systems (ITS); Internet of Vehicles (IoV); vehicular ad hoc networks (VANETs)
类别
资金
- Natural Science Foundation of China [U1936101, 61602096]
- 13th Five-Year Plan of National Cryptography Development Fund for Cryptographic Theory of China [MMJJ20170204]
- Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems
- Sichuan Science and Technology Project [2018KZ0007]
- King Saud University, Riyadh, Saudi Arabia [RSP-2019/12]
The proposed efficient certificateless aggregate signature scheme with conditional privacy preservation utilizes full aggregation technique to reduce bandwidth resources and computing overhead, and achieves conditional privacy preservation in IoV system through pseudonym mechanism. The scheme is demonstrated to be secure against Type-I and Type-II adversaries under random oracle in computational Diffie-Hellman assumption. Comparison with related works shows that the proposed scheme is efficient and suitable for resource-constrained environments.
As an extension of traditional vehicular ad hoc networks, the Internet of Vehicles (IoV) enables information collection and dissemination, which brings a lot of convenience and benefits to the intelligent transportation systems. However, the booming IoV confronts a few challenges in the aspects of vehicle location privacy preservation and the authenticity of the transmitted information. In order to meet these challenges, we propose an efficient certificateless aggregate signature scheme with conditional privacy preservation in this article. Our scheme utilizes the technique of full aggregation to reduce the bandwidth resources and computing overhead. Besides, the conditional privacy preservation in IoV system is realized by using pseudonym mechanism. We demonstrate that the proposed scheme is secure against the Type-I and Type-II adversaries in the random oracle under the computational Diffie-Hellman assumption. In addition, the proposed scheme is compared with related works from aspects of computation cost, communication efficiency, and security requirements. The comparison results show that the proposed scheme is efficient, and it is suitable for resource-constrained environments.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据