A type of sorting based on homomorphic encryption
Xu Chen, Qiming Huang · 2013
To protect the confidential of data outsourced to the cloud, we should encrypt our data before we deliver it to the cloud, but the problem is we can't sort the data, because the order of ciphertext is not always agree with the plaintext. In this paper, we propose a method of sorting based on homomorphic encryption, and the algorithm complexity is n log n. With this method, we can reduce our retrieval algorithm to log n instead of n, and many other algorithm will be easy.