A Novel Symmetric Searchable Encryption Scheme for String Identification in Cloud Computing

Abstract

In this paper, we first provide an efficient and easy-to-implement symmetric searchable encryption scheme (SSE) for string search, Unlike previous schemes, we use hash chaining instead of chain of encryption operations for index generation, which makes it suitable for lightweight applications. Here it’s 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 . Here also introduce a new notion of search pattern privacy, which gives a measure of security against the leakage from trapdoor. i have shown that our scheme is secure under search pattern in distinguishability definition. i show why SSE scheme for string search cannot attain adaptive in distinguishability criteria as mentioned and  also propose modifications of our scheme so that the scheme can be used