The University of Southampton
University of Southampton Institutional Repository

Secure searching on cloud storage enhanced by homomorphic indexing

Secure searching on cloud storage enhanced by homomorphic indexing
Secure searching on cloud storage enhanced by homomorphic indexing
Enterprise cloud tenants would store their outsourced cloud data in encrypted form for data privacy and security. However, flexible data access functions such as data searching is usually sacrificed as a result. Thus, enterprise tenants demand secure data retrieval and computation solution from the cloud provider, which will allow them to utilize cloud services without the risks of leaking private data to outsiders and even service providers.

In this paper, we propose an exclusive-or (XOR) homomorphism encryption scheme to support secure keyword searching on encrypted data for cloud storage. First, this scheme specifies a new data protection method by encrypting the keyword and randomizing it by performing XOR operation with a random bit-string for each session to protect access pattern leakage; Secondly, the homomorphic evaluation key enables the searching evaluation to be on-demand calculated, thus it removes the dependency of key storage on cloud and enhance protection against cloud’s violability; Thirdly, this scheme can effectively protect data-in-transit against passive attack such as access pattern analysis due to the randomization. This scheme also can reduce data leakage to service provider because the homomorphism-key solution instead of key storage on cloud. The above three features have been proved by the experiments and further tested out at Email service which can support secure subject searching. The execution time of one searching process is just in the order of milliseconds. We could get 2–3 times speedup compared to default utility grep with the concern of expensive one-time indexing which can be built off-line in advance.
1-9
Ren, Shu Qin
4db12f65-5bd8-4328-9896-d9b343d92e0b
Tan, Ben Hong Meng
284ca562-1e97-424c-a2e8-de4aab490a0a
Sundaram, Sivaraman
318c3a2a-6d88-4812-9949-fa16698f1ede
Wang, Taining
06898a00-a725-49be-b8ee-17ac83acdf75
Ng, Yibin
d38806db-035d-4adf-900b-46a0918ab749
Chang, Victor
a7c75287-b649-4a63-a26c-6af6f26525a4
Khin, Mi Mi Aung
d8f7f2e8-3cf2-420c-b538-bc124d076d58
Ren, Shu Qin
4db12f65-5bd8-4328-9896-d9b343d92e0b
Tan, Ben Hong Meng
284ca562-1e97-424c-a2e8-de4aab490a0a
Sundaram, Sivaraman
318c3a2a-6d88-4812-9949-fa16698f1ede
Wang, Taining
06898a00-a725-49be-b8ee-17ac83acdf75
Ng, Yibin
d38806db-035d-4adf-900b-46a0918ab749
Chang, Victor
a7c75287-b649-4a63-a26c-6af6f26525a4
Khin, Mi Mi Aung
d8f7f2e8-3cf2-420c-b538-bc124d076d58

Ren, Shu Qin, Tan, Ben Hong Meng, Sundaram, Sivaraman, Wang, Taining, Ng, Yibin, Chang, Victor and Khin, Mi Mi Aung (2016) Secure searching on cloud storage enhanced by homomorphic indexing. Future Generation Computer Systems, 1-9. (doi:10.1016/j.future.2016.03.013).

Record type: Article

Abstract

Enterprise cloud tenants would store their outsourced cloud data in encrypted form for data privacy and security. However, flexible data access functions such as data searching is usually sacrificed as a result. Thus, enterprise tenants demand secure data retrieval and computation solution from the cloud provider, which will allow them to utilize cloud services without the risks of leaking private data to outsiders and even service providers.

In this paper, we propose an exclusive-or (XOR) homomorphism encryption scheme to support secure keyword searching on encrypted data for cloud storage. First, this scheme specifies a new data protection method by encrypting the keyword and randomizing it by performing XOR operation with a random bit-string for each session to protect access pattern leakage; Secondly, the homomorphic evaluation key enables the searching evaluation to be on-demand calculated, thus it removes the dependency of key storage on cloud and enhance protection against cloud’s violability; Thirdly, this scheme can effectively protect data-in-transit against passive attack such as access pattern analysis due to the randomization. This scheme also can reduce data leakage to service provider because the homomorphism-key solution instead of key storage on cloud. The above three features have been proved by the experiments and further tested out at Email service which can support secure subject searching. The execution time of one searching process is just in the order of milliseconds. We could get 2–3 times speedup compared to default utility grep with the concern of expensive one-time indexing which can be built off-line in advance.

Text
FGCS_secure_homomorphic_accepted.pdf - Accepted Manuscript
Download (1MB)

More information

Accepted/In Press date: 16 March 2016
e-pub ahead of print date: 31 May 2016
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 395197
URI: http://eprints.soton.ac.uk/id/eprint/395197
PURE UUID: ed32ff4f-6468-4587-934e-fa857ca5184b

Catalogue record

Date deposited: 23 May 2016 17:33
Last modified: 15 Mar 2024 05:36

Export record

Altmetrics

Contributors

Author: Shu Qin Ren
Author: Ben Hong Meng Tan
Author: Sivaraman Sundaram
Author: Taining Wang
Author: Yibin Ng
Author: Victor Chang
Author: Mi Mi Aung Khin

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×