Secure search for encrypted personal health records from big data NoSQL databases in cloud

Chen, L; Zhang, N; Sun, HM; Chang, CC; Yu, S; Choo, KKR

Secure search for encrypted personal health records from big data NoSQL databases in cloud

Chen, L Zhang, N Sun, HM Chang, CC Yu, S

Choo, KKR

Permalink

Publisher:: SPRINGER WIEN
Publication Type:: Journal Article
Citation:: Computing, 2020, 102, (6), pp. 1521-1545
Issue Date:: 2020

Closed Access

	Filename	Description	Size
	Chen2020_Article_SecureSearchForEncryptedPerson.pdf		2.25 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Chen, L
dc.contributor.author	Zhang, N
dc.contributor.author	Sun, HM
dc.contributor.author	Chang, CC
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.contributor.author	Choo, KKR
dc.date.accessioned	2021-03-16T01:36:47Z
dc.date.available	2021-03-16T01:36:47Z
dc.date.issued	2020
dc.identifier.citation	Computing, 2020, 102, (6), pp. 1521-1545
dc.identifier.issn	0010-485X
dc.identifier.issn	1436-5057
dc.identifier.uri	http://hdl.handle.net/10453/147228
dc.description.abstract	© 2019, Springer-Verlag GmbH Austria, part of Springer Nature. As the healthcare industry adopts the use of cloud to store personal health record (PHR), there is a need to ensure that we maintain the ability to perform efficient search on encrypted data (stored in the cloud). In this paper, we propose a secure searchable encryption scheme, which is designed to search on encrypted personal health records from a NoSQL database in semi-trusted cloud servers. The proposed scheme supports almost all query operations available in plaintext database environments, especially multi-dimensional, multi-keyword searches with range query. Specifically, in the proposed scheme, an Adelson-Velsky Landis (AVL) tree is utilized to construct the index, and an order-revealing encryption (ORE) algorithm is used to encrypt the AVL tree and realize range query. As document-based databases are probably the most popular NoSQL database, due to their flexibility, high efficiency, and ease of use, MongoDB, a document-based NoSQL database, is chosen to store the encrypted PHR data in our scheme. Experimental results show that the scheme can achieve secure and practical searchable encryption for PHRs. A comparison of the range query demonstrates that the time overhead of our ORE-based scheme is 25.5% shorter than that of the mOPE-based Arx (an encrypted database system) scheme.
dc.language	English
dc.publisher	SPRINGER WIEN
dc.relation.ispartof	Computing
dc.relation.isbasedon	10.1007/s00607-019-00762-z
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	01 Mathematical Sciences, 08 Information and Computing Sciences
dc.subject.classification	Numerical & Computational Mathematics
dc.title	Secure search for encrypted personal health records from big data NoSQL databases in cloud
dc.type	Journal Article
utslib.citation.volume	102
utslib.for	01 Mathematical Sciences
utslib.for	08 Information and Computing Sciences
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access	*
pubs.consider-herdc	true
dc.date.updated	2021-03-16T01:36:44Z
pubs.issue	6
pubs.publication-status	Published
pubs.volume	102
utslib.citation.issue	6

Abstract:

© 2019, Springer-Verlag GmbH Austria, part of Springer Nature. As the healthcare industry adopts the use of cloud to store personal health record (PHR), there is a need to ensure that we maintain the ability to perform efficient search on encrypted data (stored in the cloud). In this paper, we propose a secure searchable encryption scheme, which is designed to search on encrypted personal health records from a NoSQL database in semi-trusted cloud servers. The proposed scheme supports almost all query operations available in plaintext database environments, especially multi-dimensional, multi-keyword searches with range query. Specifically, in the proposed scheme, an Adelson-Velsky Landis (AVL) tree is utilized to construct the index, and an order-revealing encryption (ORE) algorithm is used to encrypt the AVL tree and realize range query. As document-based databases are probably the most popular NoSQL database, due to their flexibility, high efficiency, and ease of use, MongoDB, a document-based NoSQL database, is chosen to store the encrypted PHR data in our scheme. Experimental results show that the scheme can achieve secure and practical searchable encryption for PHRs. A comparison of the range query demonstrates that the time overhead of our ORE-based scheme is 25.5% shorter than that of the mOPE-based Arx (an encrypted database system) scheme.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/147228