Efficient encrypted data search with expressive queries and flexible update

Outsourcing encrypted data to cloud servers that has become a prevalent trend among Internet users to date. There is a long list of advantages on data outsourcing, such as the reduction cost of local data management. How to securely operate encrypted data (remotely), however, is the top-rank concern...

Full description

Saved in:
Bibliographic Details
Main Authors: NING, Jianting, CHEN, Jiageng, LIANG, Kaitai, LIU, Joseph K., SU, Chunhua, WU, Qianhong
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/7828
https://ink.library.smu.edu.sg/context/sis_research/article/8831/viewcontent/EfficientEncrypted_2022_av.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-8831
record_format dspace
spelling sg-smu-ink.sis_research-88312023-10-10T04:26:56Z Efficient encrypted data search with expressive queries and flexible update NING, Jianting CHEN, Jiageng LIANG, Kaitai LIU, Joseph K. SU, Chunhua WU, Qianhong Outsourcing encrypted data to cloud servers that has become a prevalent trend among Internet users to date. There is a long list of advantages on data outsourcing, such as the reduction cost of local data management. How to securely operate encrypted data (remotely), however, is the top-rank concern over data owner. Liang et al. proposed a novel encrypted cloud-based data share and search system without loss of privacy. The system allows users to flexibly search and share encrypted data as well as updating keyword field. However, the search complexity of the system is of extreme inefficiency, O(nd), where d is the total number of system files and n is the size of query formula. This article, for the first time, leverages the "oblivious cross search" technology in public key searchable encryption context to reduce the search complexity to only O(nf(w)), where f(w) is the number of files embedded with the "least frequent keyword" w. The new scheme maintains efficient encrypted data share and keyword field update as well. This article further revisits the security models for payload security, keyword privacy and search token privacy (i.e., search pattern privacy) and meanwhile, presents security and efficiency analysis for the new scheme. 2022-05-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7828 info:doi/10.1109/TSC.2020.3004988 https://ink.library.smu.edu.sg/context/sis_research/article/8831/viewcontent/EfficientEncrypted_2022_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Secure data search share flexible query update efficiency Information Security
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Secure data search
share
flexible query
update
efficiency
Information Security
spellingShingle Secure data search
share
flexible query
update
efficiency
Information Security
NING, Jianting
CHEN, Jiageng
LIANG, Kaitai
LIU, Joseph K.
SU, Chunhua
WU, Qianhong
Efficient encrypted data search with expressive queries and flexible update
description Outsourcing encrypted data to cloud servers that has become a prevalent trend among Internet users to date. There is a long list of advantages on data outsourcing, such as the reduction cost of local data management. How to securely operate encrypted data (remotely), however, is the top-rank concern over data owner. Liang et al. proposed a novel encrypted cloud-based data share and search system without loss of privacy. The system allows users to flexibly search and share encrypted data as well as updating keyword field. However, the search complexity of the system is of extreme inefficiency, O(nd), where d is the total number of system files and n is the size of query formula. This article, for the first time, leverages the "oblivious cross search" technology in public key searchable encryption context to reduce the search complexity to only O(nf(w)), where f(w) is the number of files embedded with the "least frequent keyword" w. The new scheme maintains efficient encrypted data share and keyword field update as well. This article further revisits the security models for payload security, keyword privacy and search token privacy (i.e., search pattern privacy) and meanwhile, presents security and efficiency analysis for the new scheme.
format text
author NING, Jianting
CHEN, Jiageng
LIANG, Kaitai
LIU, Joseph K.
SU, Chunhua
WU, Qianhong
author_facet NING, Jianting
CHEN, Jiageng
LIANG, Kaitai
LIU, Joseph K.
SU, Chunhua
WU, Qianhong
author_sort NING, Jianting
title Efficient encrypted data search with expressive queries and flexible update
title_short Efficient encrypted data search with expressive queries and flexible update
title_full Efficient encrypted data search with expressive queries and flexible update
title_fullStr Efficient encrypted data search with expressive queries and flexible update
title_full_unstemmed Efficient encrypted data search with expressive queries and flexible update
title_sort efficient encrypted data search with expressive queries and flexible update
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/sis_research/7828
https://ink.library.smu.edu.sg/context/sis_research/article/8831/viewcontent/EfficientEncrypted_2022_av.pdf
_version_ 1781793933073842176