Multi-user verifiable searchable symmetric encryption for cloud storage

In a cloud data storage system, symmetric key encryption is usually used to encrypt files due to its high efficiency. In order allow the untrusted/semi-trusted cloud storage server to perform searching over encrypted data while maintaining data confidentiality, searchable symmetric encryption (SSE)...

Full description

Saved in:
Bibliographic Details
Main Authors: LIU, Xueqiao, YANG, Guomin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2020
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/7300
https://ink.library.smu.edu.sg/context/sis_research/article/8303/viewcontent/08496819.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-8303
record_format dspace
spelling sg-smu-ink.sis_research-83032022-09-29T07:39:21Z Multi-user verifiable searchable symmetric encryption for cloud storage LIU, Xueqiao YANG, Guomin YANG, Guomin In a cloud data storage system, symmetric key encryption is usually used to encrypt files due to its high efficiency. In order allow the untrusted/semi-trusted cloud storage server to perform searching over encrypted data while maintaining data confidentiality, searchable symmetric encryption (SSE) has been proposed. In a typical SSE scheme, a users stores encrypted files on a cloud storage server and later can retrieve the encrypted files containing specific keywords. The basic security requirement of SSE is that the cloud server learns no information about the files or the keywords during the searching process. Some SSE schemes also offer additional functionalities such as detecting cheating behavior of a malicious server (i.e., verifiability) and allowing update (e.g., modifying, deleting and adding) of documents on the server. However, the previous (verifiable) SSE schemes were designed for single users, which means the searching can only be done by the data owner, whereas in reality people often use cloud storage to share files with other users. In this paper we present a multi-user verifiable searchable symmetric encryption (MVSSE) scheme that achieves all the desirable features of a verifiable SSE and allows multiple users to perform searching. We then define an ideal functionality for MVSSE under the Universally Composable (UC-) security framework and prove that our ideal functionality implies the security requirements of a secure MVSSE, and our multi-user verifiable SSE scheme is UC-secure. We also implement our scheme to verify its high performance based on some real dataset. 2020-11-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7300 info:doi/10.1109/TDSC.2018.2876831 https://ink.library.smu.edu.sg/context/sis_research/article/8303/viewcontent/08496819.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 Searchable encryption dynamics verifiability multi-user UC-security Data Storage Systems Information Security
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Searchable encryption
dynamics
verifiability
multi-user
UC-security
Data Storage Systems
Information Security
spellingShingle Searchable encryption
dynamics
verifiability
multi-user
UC-security
Data Storage Systems
Information Security
LIU, Xueqiao
YANG, Guomin
YANG, Guomin
Multi-user verifiable searchable symmetric encryption for cloud storage
description In a cloud data storage system, symmetric key encryption is usually used to encrypt files due to its high efficiency. In order allow the untrusted/semi-trusted cloud storage server to perform searching over encrypted data while maintaining data confidentiality, searchable symmetric encryption (SSE) has been proposed. In a typical SSE scheme, a users stores encrypted files on a cloud storage server and later can retrieve the encrypted files containing specific keywords. The basic security requirement of SSE is that the cloud server learns no information about the files or the keywords during the searching process. Some SSE schemes also offer additional functionalities such as detecting cheating behavior of a malicious server (i.e., verifiability) and allowing update (e.g., modifying, deleting and adding) of documents on the server. However, the previous (verifiable) SSE schemes were designed for single users, which means the searching can only be done by the data owner, whereas in reality people often use cloud storage to share files with other users. In this paper we present a multi-user verifiable searchable symmetric encryption (MVSSE) scheme that achieves all the desirable features of a verifiable SSE and allows multiple users to perform searching. We then define an ideal functionality for MVSSE under the Universally Composable (UC-) security framework and prove that our ideal functionality implies the security requirements of a secure MVSSE, and our multi-user verifiable SSE scheme is UC-secure. We also implement our scheme to verify its high performance based on some real dataset.
format text
author LIU, Xueqiao
YANG, Guomin
YANG, Guomin
author_facet LIU, Xueqiao
YANG, Guomin
YANG, Guomin
author_sort LIU, Xueqiao
title Multi-user verifiable searchable symmetric encryption for cloud storage
title_short Multi-user verifiable searchable symmetric encryption for cloud storage
title_full Multi-user verifiable searchable symmetric encryption for cloud storage
title_fullStr Multi-user verifiable searchable symmetric encryption for cloud storage
title_full_unstemmed Multi-user verifiable searchable symmetric encryption for cloud storage
title_sort multi-user verifiable searchable symmetric encryption for cloud storage
publisher Institutional Knowledge at Singapore Management University
publishDate 2020
url https://ink.library.smu.edu.sg/sis_research/7300
https://ink.library.smu.edu.sg/context/sis_research/article/8303/viewcontent/08496819.pdf
_version_ 1770576307486195712