DocumentCode
690193
Title
A type of sorting based on homomorphic encryption
Author
Xu Chen ; Qiming Huang
Author_Institution
Dept. of Comput. & Commun., Univ. of Sci. & Technol. Beijing, Beijing, China
fYear
2013
fDate
15-17 Nov. 2013
Firstpage
37
Lastpage
40
Abstract
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.
Keywords
cloud computing; cryptography; algorithm complexity; ciphertext; data encryption; data outsourced; homomorphic encryption; retrieval algorithm; sorting type; Encryption; Testing; complexity; homomorphic; sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics Information and Emergency Communication (ICEIEC), 2013 IEEE 4th International Conference on
Conference_Location
Beijing
Type
conf
DOI
10.1109/ICEIEC.2013.6835448
Filename
6835448
Link To Document