Computational analysis on CSE
The secret to searching blind is to combine elements such as hash functions, encryption algorithms, authentication algorithms, and user interfaces into one helpful platform.
Computationally, the problem is to combine the best grade of security, given by the algorithms of encryption, decryption, and authentication, as well as the policies to log in and manage the platform, with the efficiency of searching in encrypted content. Suppose you want to search blindly inside the entire content of Wikipedia, encrypted, for example. In that case, the problem is the amount of content (expressed in kilobytes, gigabytes, or terabytes) and the number of keywords processed. In other words, we have to face off with a complex system given by the sum of the elements combined in CSE:
- Number of files encrypted
- Time to encrypt the files
- Bits per file and bits per total content processed
- Number of keywords processed
- Elapsed time per query...
