Optimized verifiable fine-grained keyword search in dynamic multi-owner settings

Ciphertext-Policy Attribute-Based Keyword Search (CP-ABKS) schemes support both fine-grained access control and keyword-based ciphertext retrieval, which make these schemes attractive for resource-constrained users (i.e., mobile or wearable devices, sensor nodes, etc.) to store, share and search enc...

Full description

Saved in:
Bibliographic Details
Main Authors: MIAO, Yibin, DENG, Robert H., CHOO, DENG, LIU, Ximeng, NING, Jianting, LI, Hongwei
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2019
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/5074
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-6077
record_format dspace
spelling sg-smu-ink.sis_research-60772020-03-12T06:54:03Z Optimized verifiable fine-grained keyword search in dynamic multi-owner settings MIAO, Yibin DENG, Robert H. CHOO, DENG LIU, Ximeng NING, Jianting LI, Hongwei Ciphertext-Policy Attribute-Based Keyword Search (CP-ABKS) schemes support both fine-grained access control and keyword-based ciphertext retrieval, which make these schemes attractive for resource-constrained users (i.e., mobile or wearable devices, sensor nodes, etc.) to store, share and search encrypted data in the public cloud. However, ciphertext length and decryption overhead in the existing CP-ABKS schemes grow with the complexity of access policies or the number of data users' attributes. Moreover, such schemes generally do not consider the practical multi-owner setting (e.g., each file needs to be signed by multiple data owners before being uploaded to the cloud server) or prevent malicious cloud servers from returning incorrect search results. To overcome these limitations, in this paper we first design an optimized Verifiable Fine-grained Keyword Search scheme in the static Multi-owner setting (termed as basic VFKSM), which achieves short ciphertext length, fast ciphertext transformation, accelerated search process, and authentic search result verification. Then, we extend the basic VFKSM to support multi-keyword search and multi-owner update (also called as extended VFKSM). Finally, we prove that the basic (or extended) VFKSM resists the Chosen-Keyword Attack (CKA) and external Keyword-Guessing Attack (KGA). We also evaluate the performance of these schemes using various public datasets. 2019-01-01T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/5074 info:doi/10.1109/TDSC.2019.2940573 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Access control Ciphertext length Cloud computing Complexity theory decryption overhead Encryption Keyword search multi-keyword search multi-owner setting search result verification Servers Information Security
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Access control
Ciphertext length
Cloud computing
Complexity theory
decryption overhead
Encryption
Keyword search
multi-keyword search
multi-owner setting
search result verification
Servers
Information Security
spellingShingle Access control
Ciphertext length
Cloud computing
Complexity theory
decryption overhead
Encryption
Keyword search
multi-keyword search
multi-owner setting
search result verification
Servers
Information Security
MIAO, Yibin
DENG, Robert H.
CHOO, DENG
LIU, Ximeng
NING, Jianting
LI, Hongwei
Optimized verifiable fine-grained keyword search in dynamic multi-owner settings
description Ciphertext-Policy Attribute-Based Keyword Search (CP-ABKS) schemes support both fine-grained access control and keyword-based ciphertext retrieval, which make these schemes attractive for resource-constrained users (i.e., mobile or wearable devices, sensor nodes, etc.) to store, share and search encrypted data in the public cloud. However, ciphertext length and decryption overhead in the existing CP-ABKS schemes grow with the complexity of access policies or the number of data users' attributes. Moreover, such schemes generally do not consider the practical multi-owner setting (e.g., each file needs to be signed by multiple data owners before being uploaded to the cloud server) or prevent malicious cloud servers from returning incorrect search results. To overcome these limitations, in this paper we first design an optimized Verifiable Fine-grained Keyword Search scheme in the static Multi-owner setting (termed as basic VFKSM), which achieves short ciphertext length, fast ciphertext transformation, accelerated search process, and authentic search result verification. Then, we extend the basic VFKSM to support multi-keyword search and multi-owner update (also called as extended VFKSM). Finally, we prove that the basic (or extended) VFKSM resists the Chosen-Keyword Attack (CKA) and external Keyword-Guessing Attack (KGA). We also evaluate the performance of these schemes using various public datasets.
format text
author MIAO, Yibin
DENG, Robert H.
CHOO, DENG
LIU, Ximeng
NING, Jianting
LI, Hongwei
author_facet MIAO, Yibin
DENG, Robert H.
CHOO, DENG
LIU, Ximeng
NING, Jianting
LI, Hongwei
author_sort MIAO, Yibin
title Optimized verifiable fine-grained keyword search in dynamic multi-owner settings
title_short Optimized verifiable fine-grained keyword search in dynamic multi-owner settings
title_full Optimized verifiable fine-grained keyword search in dynamic multi-owner settings
title_fullStr Optimized verifiable fine-grained keyword search in dynamic multi-owner settings
title_full_unstemmed Optimized verifiable fine-grained keyword search in dynamic multi-owner settings
title_sort optimized verifiable fine-grained keyword search in dynamic multi-owner settings
publisher Institutional Knowledge at Singapore Management University
publishDate 2019
url https://ink.library.smu.edu.sg/sis_research/5074
_version_ 1770575207312916480