The College of Education for Pure Sciences at the University of Basra, in the Department of Computer Science, discussed a master’s thesis on (a dynamic approach to searchable coding)
The message presented by the student researcher (Salem Sabah Bulbul) included creating a searchable symmetric cipher (SSE).
Customers have the ability to upload their encrypted documents to a remote server while enabling them to search encrypted documents efficiently without violating the privacy of documents and search queries. Dynamic SSE (DSSE) approaches include executing refresh queries where documents can be added or removed at the cost of leaking more information to the server. There Two important concepts of privacy in dsse curricula are foreground privacy and background privacy. The first ensures that newly added documents are not linked to previously issued search queries. The second ensures that deleting a file cannot be associated with subsequent search queries. Background privacy was first suggested by Stefanov and formally studied by The Post,
The aim of the thesis is to propose a new dsse approach that achieves the second type of back-end privacy and foreground privacy by generating new keys for each search query and preventing the server from learning the basic operation (delete or add) included in the
Update query Our scheme improves input/output performance and search cost
The study concluded to the proposed method and compared it in terms of efficiency with the most efficient previous method, which is the mitra method. The results showed that our method is superior to the previous approaches in terms of efficiency. We used the random Oracle model to prove the security of our method officially in the results obtained.
