Dual Hybrid CP-ABE: How to Provide Forward Security Without a Trusted Authority in Vehicular Opportunistic Computing
Lei Meng, Haitao Xu, Runze Tang, Xianwei Zhou, Zhu Han
Abstract
The rapid development of the acrlong IoV has placed a heavy burden on the edge server. Conversely, many idle vehicles parked near the vehicle in demand are not utilized. Opportunistic computing of vehicles can organize these idle vehicles to provide computing services, but this also requires a secure data-sharing scheme to offer support. Although the existing ciphertext policy attribute-based encryption (CP-ABE) can provide a secure fine-grained data sharing, they either map the data to an algebra element that cannot be applied in practice due to the limited length, or they are hybrid schemes that cannot satisfy the forward security. In addition, they require a trusted authority (TA), which may be unrealistic in implementation. To cope with these issues, we propose a dual hybrid CP-ABE scheme without a TA for vehicular opportunistic computing (VOC) in this article. We exploit the dual hybrid mechanism to solve the problem of forward security in hybrid schemes and eliminate the TA by combining the characteristics of VOC. Then, we prove the acrlong IND-sCPA and forward security of the scheme. Finally, we evaluate the computation, storage, and communication cost from theoretical and simulation perspectives and compare them with other typical schemes. These results illustrate that the proposed scheme has better efficiency and lower storage and communication cost in general.