Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/32618

Title: A new lightweight symmetric searchable encryption scheme for string identification
Authors: Ghosh Ray, Indranil
Rahulamathavan, Yogachandran
Rajarajan, Muttukrishnan
Keywords: Cloud storage
Symmetric key
Searchable encryption
Hash-chain
Lightweight cryptography
Issue Date: 2018
Publisher: © IEEE
Citation: GHOSH RAY, I., RAHULAMATHAVAN, Y. and RAJARAJAN, M., 2018. A new lightweight symmetric searchable encryption scheme for string identification. IEEE Transactions on Cloud Computing, doi:10.1109/TCC.2018.2820014.
Abstract: In this paper, we provide an efficient and easy-to-implement symmetric searchable encryption scheme (SSE) for string search, which takes one round of communication, O(n) times of computations over n documents. Unlike previous schemes, we use hash-chaining instead of chain of encryption operations for index generation, which makes it suitable for lightweight applications. Unlike the previous SSE schemes for string search, with our scheme, server learns nothing about the frequency and the relative positions of the words being searched except what it can learn from the history. We are the first to propose probabilistic trapdoors in SSE for string search. We provide concrete proof of non-adaptive security of our scheme against honest-but-curious server based on the definitions of [12]. We also introduce a new notion of search pattern privacy, which gives a measure of security against the leakage from trapdoor. We have shown that our scheme is secure under search pattern indistinguishability definition. We show why SSE scheme for string search cannot attain adaptive indistinguishability criteria as mentioned in [12]. We also propose modifications of our scheme so that the scheme can be used against active adversaries at the cost of more rounds of communications and memory space. We validate our scheme against two different commercial datasets (see [1],[2]).
Description: © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Sponsor: This research was partly supported by the Engineering and Physical Sciences Research (EPSRC) UK project Trusted Things & Communities: Understanding Enabling A Trusted ioT Ecosystem and European Commissions Horizon 2020 research and innovation project RED - Alert under grant agreement No 740688.
Version: Accepted for publication
DOI: 10.1109/TCC.2018.2820014
URI: https://dspace.lboro.ac.uk/2134/32618
Publisher Link: https://doi.org/10.1109/TCC.2018.2820014
Appears in Collections:Published Articles (Loughborough University London)

Files associated with this item:

File Description SizeFormat
sse_string_revised.pdfAccepted version422.45 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.