Next Article in Journal
Windows Based Data Sets for Evaluation of Robustness of Host Based Intrusion Detection Systems (IDS) to Zero-Day and Stealth Attacks
Next Article in Special Issue
Main Issues in Big Data Security
Previous Article in Journal
Density Self-Adaptive Hybrid Clustering Routing Protocol for Wireless Sensor Networks
Previous Article in Special Issue
Supporting Privacy of Computations in Mobile Big Data Systems
Article Menu

Export Article

Open AccessArticle
Future Internet 2016, 8(3), 28; doi:10.3390/fi8030028

Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

Computer Science Department, Colorado State University, Fort Collins, CO 80523, USA
This paper is an extended version of our paper published in the 2015 IEEE International Conference on Cloud Engineering (IC2E), Tempe, AZ, USA, 9–13 March 2015.
*
Author to whom correspondence should be addressed.
Academic Editors: Eduardo Fernández-Medina Patón and David G. Rosado
Received: 15 January 2016 / Revised: 17 June 2016 / Accepted: 23 June 2016 / Published: 4 July 2016
(This article belongs to the Special Issue Security in Cloud Computing and Big Data)
View Full-Text   |   Download PDF [925 KB, uploaded 4 July 2016]   |  

Abstract

Existing Searchable Encryption (SE) solutions are able to handle simple Boolean search queries, such as single or multi-keyword queries, but cannot handle substring search queries over encrypted data that also involve identifying the position of the substring within the document. These types of queries are relevant in areas such as searching DNA data. In this paper, we propose a tree-based Substring Position Searchable Symmetric Encryption (SSP-SSE) to overcome the existing gap. Our solution efficiently finds occurrences of a given substring over encrypted cloud data. Specifically, our construction uses the position heap tree data structure and achieves asymptotic efficiency comparable to that of an unencrypted position heap tree. Our encryption takes O ( k n ) time, and the resulting ciphertext is of size O ( k n ) , where k is a security parameter and n is the size of stored data. The search takes O ( m 2 + o c c ) time and three rounds of communication, where m is the length of the queried substring and o c c is the number of occurrences of the substring in the document collection. We prove that the proposed scheme is secure against chosen-query attacks that involve an adaptive adversary. Finally, we extend SSP-SSE to the multi-user setting where an arbitrary group of cloud users can submit substring queries to search the encrypted data. View Full-Text
Keywords: substring position search; searchable symmetric encryption; cloud computing; position heap tree substring position search; searchable symmetric encryption; cloud computing; position heap tree
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Strizhov, M.; Osman, Z.; Ray, I. Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup. Future Internet 2016, 8, 28.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top