2023, Vol. 4, Issue 1, Part A

In this paper, we give an effective and easy-to-use symmetric Searchable symmetric encryption (SSE) for string search. Unlike previous plans, we use hash affixing instead of a chain of encryption activities for record age, which makes it suitable for lightweight applications. Here is the first time that probabilistic trapdoors for string search in SSE are suggested. We give solid proof that our plan isn't secure against a real but curious server, depending on the definitions. Here, we also show another idea for search design protection, which protects some of the spillage from the trapdoor. I've shown that our plan is safe under the inquiry design in the definition of noticeability. I explain why SSE's scheme for string search can't meet the flexibility criteria mentioned, and I also suggest changes to our plan so that it can be used against moving enemies at the cost of more changes to communications and more memory space.