A Sorting and Searching Scheme for Relational Database Using Searchable Encryption

This paper adopts a sorting and searching (S&S) scheme using searchable encryption (SE) that searches encrypted data over the relational database. The key concept of SE is that the user sends a ciphertext with a key, and the corresponding recipient obtains this message with another key. The distributed asymmetric SE scans the document and constructs a word list by scanning and parsing, and thus finds the frequency of words in the document. Also, the correlation score and optimally matched documents lead to attaining the desired outcome. Thereby, the exploited search overcomes the deficiency of asymmetric SE. For this, it combines the qualities of both asymmetric SE and symmetric SE. Hence, the scheme can be applied in the domain of relational database settings to promote its users for protecting their data. Finally, the experimental results, comparisons, analyses, etc. confirm the usefulness of the scheme.