15 January 2025 in IEEE Internet of Things Journal
Electronic Medical Records (EMR) are the essential sensitive personal data that is shared between patients and doctors through the semi-trusted E-health cloud. In the real application, Multi-Authority Ciphertext-Policy Attribute-Based Searchable Encryption (MA-CP-ABSE) is suitable to protect the security of the EMR for it possesses fine-grained access permission, effcient key management and retrieval function over the encrypted data. However, previously proposed MA-CP-ABSE schemes are commonly restricted by the central authority, which is required by all attribute authorities in some operations like generating users’ secret keys. To deal with this issue, we proposed a Decentralized MA-CP-ABSE (DMA-CP-ABSE) scheme. In our scheme, any attribute authority can become an independent authority to generate a secret key, which is no longer controlled by the central authority. Furthermore, a single keyword search will produce many disrelated search results. For this, we enhance the DMA-CP-ABMSE scheme by implementing a multi-keyword search function to improve the search accuracy. Besides, to handle the dynamic changing of access permission, we have designed the attribute revocation methods. Finally, we process the formal security analysis to demonstrate our scheme is secure under the Chosen-Keyword Attack (CKA) and implement experiments to show its effciency and feasibility.
2 May 2025 in IEEE Transactions on Information Forensics and Security
Cloud-based outsourced Location-based services significantly impact various aspects of daily life but also raise security concerns. Existing secure retrieval schemes for spatiotemporal data exhibit significant shortcomings regarding dynamic updates; they either compromise privacy through information leakage during updates (lacking forward security) or incur excessively high update costs, hindering practical application. To address these limitations, we first propose a basic filter-based spatio-temporal range query scheme Trinity-I that supports lowcost dynamic updates and automatic expansion. Furthermore, to improve security, reduce storage cost, and false positives, we propose a forward secure and verifiable scheme Trinity-II that simultaneously minimizes storage overhead. Formal security analysis demonstrates that both Trinity-I and Trinity-II achieve Indistinguishability under Selective Chosen-Plaintext Attack (IND-SCPA). Finally, extensive experiments demonstrate that our design Trinity-II significantly reduces storage requirements by 80%, enables data retrieval at the 1 million-record level in just 0.01 seconds, and achieves 10× update efficiency than state-of-art.
11 November 2026 in IEEE Transactions on Knowledge and Data Engineering