Verifiable Key-Aggregate Searchable Encryption Scheme for Fog-Based Internet of Autonomous Vehicles
The fog-based Internet of Autonomous Vehicles (FB-IAV) collects extensive sensing data to enhance its understanding of the environment. As vehicles generate unique keys for encryption and receive keyword details from data requesters for the secure transmission of specialized environmental data, FB-I...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/6/3081 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The fog-based Internet of Autonomous Vehicles (FB-IAV) collects extensive sensing data to enhance its understanding of the environment. As vehicles generate unique keys for encryption and receive keyword details from data requesters for the secure transmission of specialized environmental data, FB-IAV increases the risk of key leakage increases. Additionally, the fog server may be manipulated to alter search results. Current approaches do not adequately consider the potential for vehicles to inadvertently disclose keyword details of data requesters. Moreover, the cost of verifying search results is substantial for these systems. To tackle these problems, we offer a new blockchain-verifiable, multiple-keyword searching method for FB-IAV. At first glance, the proposed scheme is based on key-aggregate searchable encryption, which achieves safe key aggregation by using blockchain technology and an oblivious search request. The method uses a dual-verified technique to provide efficient verification for the outcomes of the search. The suggested plan can achieve authorization, requester privacy, accountability, and dual validation, in addition to ensuring secure search. Furthermore, the efficiency of the suggested scheme in accomplishing the specified security goals is demonstrated by the security analysis and proof. Lastly, the performance study shows that the proposed scheme is both significantly feasible and scalable. |
|---|---|
| ISSN: | 2076-3417 |