A novel symmetric searchable encryption scheme for string identification in cloud computing

Abstract

In this paper, we initially give a productive and simple to-actualize symmetric accessible encryption conspire (SSE) for string search, unlike past plans, we use hash affixing rather than chain of encryption activities for record age, which makes it reasonable for lightweight applications. Here it's first to propose probabilistic trapdoors in SSE for string search. We give solid evidence of non-versatile security of our plan against genuine yet inquisitive server dependent on the definitions. Here additionally present another idea of search design protection, which gives a proportion of protection from the spillage from trapdoor. I have demonstrated that our plan is secure under inquiry design in noticeability definition. I show why SSE conspire for string search can't achieve versatile in noticeability criteria as referenced and furthermore propose adjustments of our plan with the goal that the plan can be utilized against dynamic foes at the expense of more adjusts of correspondences and memory space.