ISEkFT: An IBE-Based Searchable Encryption Scheme With k-Keyword Fuzzy Search Trapdoor

ISEkFT: An IBE-Based Searchable Encryption Scheme With k-Keyword Fuzzy Search Trapdoor

Mamta, Brij B. Gupta, Syed Taqi Ali
Copyright: © 2019 |Pages: 21
DOI: 10.4018/JITR.2019070108
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Public-key encryption with keyword search (PEKS) is a well-known technique which allows searching on encrypted data using the public key system. However, this technique suffers from the keyword guessing attack (KGA). To address this problem, a modified version of PEKS called public key encryption with fuzzy keyword search (PEFKS) has been introduced where each keyword is associated with an exact search trapdoor (EST) and a fuzzy search trapdoor (FST) which is provided to the cloud server. PEFKS prevents KGA in such a way that two or maximum three keywords share the same FST. Hence, even if the cloud server knows the FST it cannot link it to the corresponding keyword. But, with a probability of 1/3 the malicious cloud server can still guess the keyword corresponding to FST. Therefore, in this article, the authors present an approach which can improve the security of the PEFKS technique by reducing the probability of guessing the keyword to 1/k where k is the number of keywords that share the same FST, thus enhancing the overall reliability. In addition, the authors have used an identity-based encryption (IBE) as an underlying technique to construct the searchable encryption scheme and proved its security in the standard model.
Article Preview
Top

1. Introduction

Cloud computing provides on-demand services like servers, storage, applications, networking resources etc. to the users by connecting tons of computing resources together. Among these services, cloud storage is a new network-based data storage technique which can be used for data outsourcing at reduced operational cost and this stored data can be accessed at any time anywhere quiet easily through any device connected to the Internet (Ren et al., 2012). In spite of these benefits, users are sometimes reluctant to adopt it because of inherent security issues. Therefore, to address these issues data is stored in the encrypted form over an untrusted server (Kamara and Lauter, 2010) but at the same time encryption eliminates searching capability for the data owner. Hence, the concept of searchable encryption (SE) comes into play. SE enables a third-party cloud server to perform keyword-based search over encrypted data on behalf of the data user without asking for the secret key. SE allows search over encrypted data if the data user provides a search trapdoor for that particular keyword to the third-party cloud server. Searchable encryption schemes (Gupta et al., 2016; Yu et al., 2018; Zheng et al., 2018; Yu et al., 2018) have been developed for both symmetric and asymmetric encryption settings. If symmetric key setting is used for the construction of searchable encryption, then it is known as symmetric searchable encryption (SSE) (Song et al., 2000; Goh et al., 2003; Agrawal et al., 2004; Curtmola et al., 2011). In multi-user setting SSE suffers from the complicated process of key sharing, i.e. each sender must get a secret key before encrypting the message for the intended recipient. In order to make this process simple the idea of using the public-key setting was first proposed by Boneh et al. (2004) and is known as public key encryption with keyword search (PEKS). PEKS enables data encryption by any user who can see the public key of the recipient, thus provides flexibility. So, public-key setting is the preferable choice for searchable encryption. After this, many searchable encryption schemes were developed in public key setting using techniques like identity-based encryption (Abdalla et al., 2005; Wu et al., 2017a; Lu et al., 2017) and attribute-based encryption (Sun et al., 2016; Han et al., 2017; Miao et al., 2016; Fan et al., 2018). In this paper, the identity-based encryption is used for the construction of proposed searchable encryption scheme.

Complete Article List

Search this Journal:
Reset
Volume 16: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 15: 6 Issues (2022): 1 Released, 5 Forthcoming
Volume 14: 4 Issues (2021)
Volume 13: 4 Issues (2020)
Volume 12: 4 Issues (2019)
Volume 11: 4 Issues (2018)
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing