Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data

Li, H; Yang, Y; Dai, Y; Yu, S; Xiang, Y

Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data

Li, H Yang, Y Dai, Y Yu, S

Xiang, Y

Permalink

Publisher:: Institute of Electrical and Electronics Engineers
Publication Type:: Journal Article
Citation:: IEEE Transactions on Cloud Computing, 2020, 8, (2), pp. 484-494
Issue Date:: 2020-04-01

Closed Access

	Filename	Description	Size
	08094895.pdf	Published version	1.65 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	Li, H
dc.contributor.author	Yang, Y
dc.contributor.author	Dai, Y
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.contributor.author	Xiang, Y
dc.date.accessioned	2021-03-30T03:49:39Z
dc.date.available	2021-03-30T03:49:39Z
dc.date.issued	2020-04-01
dc.identifier.citation	IEEE Transactions on Cloud Computing, 2020, 8, (2), pp. 484-494
dc.identifier.issn	2168-7161
dc.identifier.issn	2168-7161
dc.identifier.uri	http://hdl.handle.net/10453/147653
dc.description.abstract	© 2013 IEEE. In medical cloud computing, a patient can remotely outsource her medical data to the cloud server. In this case, only authorized doctors are allowed to access the data since the medical data is highly sensitive. Before outsourcing, the data is commonly encrypted, where the corresponding secret key is sent to authorized doctors. However, performing searches on encrypted medical data is difficult without decryption. In this paper, we propose two Secure and Efficient Dynamic Searchable Symmetric Encryption (SEDSSE) schemes over medical cloud data. First, we utilize the secure k-Nearest Neighbor (kNN) and Attribute-Based Encryption (ABE) techniques to construct a dynamic searchable symmetric encryption scheme, which can achieve forward privacy and backward privacy simultaneously. These tow security properties are vital and very challenging in the area of dynamic searchable symmetric encryption. Then, we propose an enhanced scheme to solve the key sharing problem which widely exists in the kNN based searchable encryption scheme. Compared with existing proposals, our schemes are better in terms of storage, search and updating complexity. Extensive experiments demonstrate the efficiency of our schemes on storage overhead, index building, trapdoor generating and query.
dc.language	English
dc.publisher	Institute of Electrical and Electronics Engineers
dc.relation.ispartof	IEEE Transactions on Cloud Computing
dc.relation.isbasedon	10.1109/TCC.2017.2769645
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 0806 Information Systems
dc.title	Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data
dc.type	Journal Article
utslib.citation.volume	8
utslib.for	0805 Distributed Computing
utslib.for	0806 Information Systems
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-30T03:49:37Z
pubs.issue	2
pubs.publication-status	Published
pubs.volume	8
utslib.citation.issue	2

Abstract:

© 2013 IEEE. In medical cloud computing, a patient can remotely outsource her medical data to the cloud server. In this case, only authorized doctors are allowed to access the data since the medical data is highly sensitive. Before outsourcing, the data is commonly encrypted, where the corresponding secret key is sent to authorized doctors. However, performing searches on encrypted medical data is difficult without decryption. In this paper, we propose two Secure and Efficient Dynamic Searchable Symmetric Encryption (SEDSSE) schemes over medical cloud data. First, we utilize the secure k-Nearest Neighbor (kNN) and Attribute-Based Encryption (ABE) techniques to construct a dynamic searchable symmetric encryption scheme, which can achieve forward privacy and backward privacy simultaneously. These tow security properties are vital and very challenging in the area of dynamic searchable symmetric encryption. Then, we propose an enhanced scheme to solve the key sharing problem which widely exists in the kNN based searchable encryption scheme. Compared with existing proposals, our schemes are better in terms of storage, search and updating complexity. Extensive experiments demonstrate the efficiency of our schemes on storage overhead, index building, trapdoor generating and query.

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

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