Publication Type

Journal Article

Version

publishedVersion

Publication Date

4-2016

Abstract

Searchable encryption is of increasing interest for protecting the data privacy in secure searchable cloud storage. In this paper, we investigate the security of a well-known cryptographic primitive, namely, public key encryption with keyword search (PEKS) which is very useful in many applications of cloud storage. Unfortunately, it has been shown that the traditional PEKS framework suffers from an inherent insecurity called inside keyword guessing attack (KGA) launched by the malicious server. To address this security vulnerability, we propose a new PEKS framework named dual-server PEKS (DS-PEKS). As another main contribution, we define a new variant of the smooth projective hash functions (SPHFs) referred to as linear and homomorphic SPHF (LH-SPHF). We then show a generic construction of secure DS-PEKS from LH-SPHF. To illustrate the feasibility of our new framework, we provide an efficient instantiation of the general framework from a Decision Diffie–Hellman-based LH-SPHF and show that it can achieve the strong security against inside the KGA.

Keywords

search, secure cloud storage, encryption, inside keyword guessing attack, smooth projective hash function, Diffie-Hellman language

Discipline

Data Storage Systems | Information Security

Research Areas

Information Systems and Management

Publication

IEEE Transactions on Information Forensics and Security

Volume

11

Issue

4

First Page

789

Last Page

798

ISSN

1556-6013

Identifier

10.1109/TIFS.2015.2510822

Publisher

Institute of Electrical and Electronics Engineers

Additional URL

http://doi.org/10.1109/TIFS.2015.2510822

Download

Share

COinS