PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 24, 2026The Computer Journal0 citations

An authenticated field-free multi-keyword data search scheme for the Internet of Health Things

View Full Paper
JLJianchang LaiSoutheast UniversityLLL LiSoutheast UniversitySXShengmin XuFujian Normal University

Key Points

  • The aim is to enhance the efficiency and security of retrieving encrypted health data in the Internet of Health Things.
  • Proposed an SM9-based authenticated field-free multi-keyword searchable encryption scheme.
  • Utilized polynomial techniques for effective multi-keyword searches without field restrictions.
  • Conducted theoretical analysis and experiments to evaluate performance.
  • Achieved a reduction in computational overhead by approximately 92% with a single execution of the index generation algorithm.
  • Decreased index storage cost by at least 45% compared to existing schemes.
  • Improved search efficiency by at least 73%, making it more practical for IoHT applications.

Abstract

Abstract In the Internet of Health Things (IoHT), patients upload encrypted health data to the cloud, enabling doctors to access records remotely, and make timely diagnoses beyond geographical limits. A potential challenge is the efficient retrieval of specific medical data by doctors from large-scale encrypted datasets. Identity-based encryption with keyword search offers a feasible solution and addresses certificate management problem. Multi-keyword search is essential in IoHT as it improves retrieval efficiency. This paper proposes an SM9-based authenticated field-free multi-keyword searchable encryption scheme. The proposed scheme overcomes the limitation of existing SM9-based searchable encryption schemes that only support single-keyword search and provides resistance against keyword guessing attack, enhancing both functionality and security. We use the polynomial technique to achieve multi-keyword search while eliminating keyword field restrictions, resulting in high flexibility. Our scheme is proven to satisfy secure index indistinguishability and search token indistinguishability. Theoretical analysis and experimental results demonstrate its effectiveness. In multi-keyword search scenarios, compared with existing SM9-based schemes that require repeated executions of the index generation algorithm, our scheme reduces computational overhead by at least 92% with a single execution and further decreases index storage cost by at least 45%. Moreover, it improves search efficiency by at least 73%, making it more suitable for the IoHT.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lai et al. (2026) studied this question.

synapsesocial.com/papers/69eb0bc7553a5433e34b5650https://doi.org/10.1093/comjnl/bxag042
Ask AI
Helpful
Bookmark
Share
View Full Paper