Name
Title | ||
|---|---|---|
PMRQ: Achieving Efficient and Privacy-Preserving Multidimensional Range Query in eHealthcare |
Abstract | ||
|---|---|---|
Healthcare data explosion and cloud computing booming have motivated healthcare centers to outsource their healthcare data and data-driven services to a powerful cloud. Nevertheless, due to privacy concerns, the data are usually encrypted before being outsourced, which will degrade the data utility and make it challenging to implement data-driven services. Although the multidimensional range query over encrypted data, as one of the most popular outsourced services in eHealthcare, has been extensively studied, existing solutions still have some limitations in efficiency, privacy, and practicality. Aiming at this challenge, in this article, we design an efficient and privacy-preserving multidimensional range query (PMRQ) scheme. We first build an R-tree to index the data set and reduce the R-tree-based range queries to the multidimensional range intersection problem. Then, by delicately designing a data comparison algorithm and a homomorphic encoding technique, we present an encoding-based range intersection algorithm. After that, by employing matrix encryption to protect the privacy of the encoding-based range intersection algorithm, we design a multidimensional range intersection predicate encryption (MRIPE) scheme. Based on the MRIPE scheme, we then propose our PMRQ scheme. A detailed security analysis illustrates that our PMRQ scheme is privacy preserving, and experimental results demonstrate that it is computationally efficient. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/JIOT.2022.3158321 | IEEE Internet of Things Journal |
Keywords | DocType | Volume |
eHealthcare,homomorphic encoding,multidimensional range query,R-tree,single-dimensional privacy | Journal | 9 |
Issue | Citations | PageRank |
18 | 1 | 0.35 |
References | Authors | |
22 | 7 | |