Achieving Secure and Efficient Emergency Data Sharing based on Searchable Proxy Re- Encryption

Feng Quan Yu, Jing Xi, Linghui Meng, Daicen Jiang, Qianhui Lu, Xianxian Li · 2024

Digitize emergency data is a critical resource for enterprises to manage emergency situations and disaster response, and its secure and rapid sharing is crucial. The searchable proxy re-encryption scheme aims to enable users to query encrypted data while sharing, ensuring data confidentiality. However, existing research schemes encounter two primary issues. The first issue is that users query keywords beyond their authority, potentially allowing an attacker to infer emergency data from keywords, leading to data leakage. Second, traditional searchable proxy re-encryption schemes exhibit slow retrieval responses when handling large volumes of emergency data, causing delays that hinder timely enterprise decision-making and data processing. To address these issues, this paper proposes a secure and efficient searchable proxy re-encryption scheme for emergency data sharing (SESPRE). In this scheme, the Access Control List (ACL) is implemented by the service provider, and user information and keyword permissions are verified prior to searching. This ensures that data users cannot exceed their authority to query keywords, thus protecting the relevant information of the emergency data. Additionally, we introduce an inverted index structure and B+ tree to enhance search efficiency, reduce response time, and improve overall performance, thereby effectively managing large volumes of emergency data. Finally, smart contracts are utilized to verify disputed data, ensuring the reliability of emergency data. Experimental results demonstrate that SESPRE enables secure querying within authorized scope, improves search efficiency, reduces response time, and enhances the overall security and rapid response capability of the system.

Read the paper · More papers on PaperTik