Next Article in Journal
Sampling Based Histogram PCA and Its Mapreduce Parallel Implementation on Multicore
Previous Article in Journal
Linguistic Neutrosophic Generalized Partitioned Bonferroni Mean Operators and Their Application to Multi-Attribute Group Decision Making
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(5), 161; https://doi.org/10.3390/sym10050161

Searching on Encrypted E-Data Using Random Searchable Encryption (RanSCrypt) Scheme

1
Department of Computer System & Technology, Faculty of Computer Science & Information Technology University of Malaya, Kuala Lumpur 50603, Malaysia
2
Collage of Computer Science, King Khalid University, Abha 61421, Saudi Arabia
3
Department of Computer Science, Abdul Wali Khan University, Mardan 23200, Pakistan
4
Faculty of Computing and Information Technology, Northern Border University, Rafha 76323, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Received: 5 March 2018 / Revised: 16 April 2018 / Accepted: 26 April 2018 / Published: 15 May 2018
View Full-Text   |   Download PDF [4017 KB, uploaded 15 May 2018]   |  

Abstract

Cloud computing is intensifying the necessity for searchable encryption (SE) for data protection in cloud storage. SE encrypts data to preserve its confidentiality while offering a secure search facility on the encrypted data. Typical index-based SEs in data sharing scenarios can effectively search secure keyword indexes. However, due to the smaller size of the keyword space, SEs using a public key are susceptible to a Keyword Guessing Attack (KGA) and other statistical information leakage. In this paper, for secure search in a data sharing scenario, we propose Random Searchable enCryption (RanSCrypt) that adds randomness to a transformed keyword to increase its space and aspires to make it irreversible. At the core of the mechanism, two keywords are garbled with randomness, still enabling another party to determine if the two garbled keywords (RanSCrypt’s terms REST and Trapdoor) are the same or not without knowing the actual keywords. As SE in a public key setting suffers from vulnerability to KGA, RanSCrypt transfers into a symmetric key setting with minimum overhead and without losing the features of a data sharing scenario. RanSCrypt also adulterates the search result to add perplexity and provides full control of access only to the data receiver. The receiver can cull out the erroneous results from the search result locally. Finally, we introduce a new type of attack on SE, namely, the Keyword Luring Attack (KLA), and show that RanSCrypt is safe from KLA attack due to adulteration of the result. Our security analysis proves RanSCrypt is invulnerable against KGA and leaks no information. View Full-Text
Keywords: searchable encryption; random searchable encryption; RanSCrypt; keyword guessing attack; KGA; statistical attack; secure search; keyword indistinguishability searchable encryption; random searchable encryption; RanSCrypt; keyword guessing attack; KGA; statistical attack; secure search; keyword indistinguishability
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

Share & Cite This Article

MDPI and ACS Style

Ahsan, M.A.M.; Idna Bin Idris, M.Y.; Bin Abdul Wahab, A.W.; Ali, I.; Khan, N.; Al-Garwi, M.A.; Rahman, A.U. Searching on Encrypted E-Data Using Random Searchable Encryption (RanSCrypt) Scheme. Symmetry 2018, 10, 161.

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]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top