sse_string_revised.pdf (422.45 kB)
A new lightweight symmetric searchable encryption scheme for string identification
journal contribution
posted on 2018-04-17, 10:40 authored by Indranil Ghosh Ray, Yogachandran RahulamathavanYogachandran Rahulamathavan, Muttukrishnan RajarajanIn 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]).
Funding
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.
History
School
- Loughborough University London
Published in
IEEE Transactions on Cloud ComputingVolume
8Issue
3Pages
672 - 684Citation
GHOSH RAY, I., RAHULAMATHAVAN, Y. and RAJARAJAN, M., 2020. A new lightweight symmetric searchable encryption scheme for string identification. IEEE Transactions on Cloud Computing, 8 (3), pp.672-684.Publisher
© IEEEVersion
- AM (Accepted Manuscript)
Acceptance date
2018-03-22Publication date
2018-03-27Notes
© 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.ISSN
2168-7161eISSN
2168-7161Publisher version
Language
- en
Administrator link
Usage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC