Attribute Set-Based Boolean Keyword Search over Encrypted Personal Health Records

Yu Lin,Wanhua Li,Zhiwei Sun,Lingling Xu,Xin-Yi Huang

doi:10.1155/2021/9023141

Abstract

A personal health record (PHR) is an electronic application which enables patients to collect and share their health information. With the development of cloud computing, many PHR services have been outsourced to cloud servers. Cloud computing makes it easier for patients to manage their personal health records and makes it easier for doctors and researchers to share and access this information. However, due to the high sensitivity of PHR, a series of security protections are needed to protect them, such as encryption and access control. In this article, we propose an attribute set-based Boolean keyword search scheme, which can realize fine-grained access control and Boolean keyword search over encrypted PHR. Compared with the existing attribute-based searchable encryption, our solution can not only improve the flexibility in specifying access policies but also perform Boolean keyword search, which can meet the needs of large-scale PHR users. Furthermore, we simulate our scheme, and the experimental results show that our scheme is practical for PHR systems in cloud computing.

Highlights

In recent years, with the rapid development of cloud computing, it has been successfully deployed in a wide variety of real-world applications, such as the medical industry
A lot of security issues have happened in recent years, which have brought huge economic losses. us, it is very important to develop a method for protecting the security and privacy of personal health record (PHR). e most common method is to encrypt the PHR before uploading them to the server
We present an attribute set-based Boolean keyword search (ASBBKS) scheme over encrypted PHR in cloud computing

Summary

Introduction

With the rapid development of cloud computing, it has been successfully deployed in a wide variety of real-world applications, such as the medical industry. It means that each legitimate user can query all of the encrypted data, which may cause security issues To solve this problem, researchers have proposed SE schemes with access control such as attribute-based encryption with keyword search (ABKS) [22,23,24,25,26]. En, users can search over encrypted data with trapdoors without revealing interested keywords In these schemes, user’s attributes are organized to a single set, which decreases the flexibility in specifying access policies. In ASBE, the user’s attributes are organized in the form of recursive set structure which enables the data owners to encrypt data with more flexible access policies than ABE Based on this technique, Xu et al [7] proposed attribute set-based keyword search (ASBKS).

Preliminaries

Our Construction of ASBBKS

Performance Analysis

Conclusion