Volume 16 - Issue 1
Symmetric Searchable Encryption Capable of Searching for an Arbitrary String
Abstract
In this paper, we give a successful and easy to-execute symmetric open encryption plot (SSE) for string look for, which takes one round of correspondence, O(n) times of figuring’s over n documents. As opposed to past plans, we use hash-mooring as opposed to chain of encryption exercises for record age, which makes it proper for lightweight applications. Not at all like the past SSE plans for string look for, with our arrangement, server adjusts nothing about the repeat and the general spots of the words being looked beside what it can pick up from the history. We are the first to propose probabilistic trapdoors in SSE for string look. We give strong affirmation of non-adaptable security of our arrangement against real yet curious server subject to the implications. We have exhibited that our arrangement is secure under request configuration absence of definition. We demonstrate why SSE plot for string look for can't achieve adaptable idea criteria as referenced in [12]. We moreover propose changes of our arrangement with the objective that the arrangement can be used against dynamic foes to the detriment of more modifies of correspondences and memory space. We endorse our arrangement against two assorted business datasets.
Paper Details
PaperID: 201013
Author's Name: M. Ramesh, K. Praveen Kumar and P. Siva Prasad
Volume: Volume 16
Issues: Issue 1
Keywords: Cloud Stockpiling, Symmetric Key, Searchable Encryption, Hash-chain, Lightweight Cryptography.
Year: 2020
Month: February
Pages: 79-86