An Efficient Searchable Encryption Against Keyword Guessing Attacks for Sharable Electronic Medical Records in...

Area of Science:

• Computer Science
• Information Security
• Health Informatics

Background:

• Electronic Medical Records (EMRs) require robust privacy preservation, especially with cloud adoption.
• Searchable encryption enables secure data utilization over encrypted EMRs.
• Efficiently sharing encrypted EMRs among multiple users remains a significant challenge.

Purpose of the Study:

• To propose a cost-efficient Secure Channel Free searchable encryption (SCF-PEKS) scheme for sharable EMRs.
• To address limitations in storage overhead and computation performance of existing solutions.
• To enhance security by guarding against keyword guessing attacks.

Main Methods:

• Development of a novel SCF-PEKS scheme tailored for sharable EMRs.
• Comparative analysis of the proposed scheme against existing SCF-PEKS solutions.
• Implementation and performance evaluation of the proposed scheme and a latest medical-based scheme.

Main Results:

• The proposed SCF-PEKS scheme demonstrates reduced storage overhead.
• The scheme achieves superior computation performance compared to existing methods.
• The proposed scheme effectively guards against keyword guessing attacks, a vulnerability in many current systems.

Conclusions:

• The developed SCF-PEKS scheme offers a more efficient and secure solution for searchable encrypted sharable EMRs.
• The scheme provides significant performance improvements over the latest medical-based schemes.
• This work contributes to enhancing the privacy and usability of EMRs in cloud environments.