Cryptology ePrint Archive: Report 2015/995
Updates on Sorting of Fully Homomorphic Encrypted Data
Nitesh Emmadi and Praveen Gauravaram and Harika Narumanchi and Habeeb Syed
Abstract: In this paper, we show implementation results of various algorithms that sort data encrypted with Fully Ho- momorphic Encryption scheme based on Integers. We analyze the complexities of sorting algorithms over encrypted data by considering Bubble Sort, Insertion Sort, Bitonic Sort and Odd- Even Merge sort. Our complexity analysis together with imple- mentation results show that Odd-Even Merge Sort has better performance than the other sorting techniques. We observe that complexity of sorting in homomorphic domain will always have worst case complexity independent of the nature of input. In addition, we show that combining different sorting algorithms to sort encrypted data does not give any performance gain when compared to the application of sorting algorithms individually.
Category / Keywords: Fully Homomorphic Encryption, Cloud Computing, Sorting
Original Publication (in the same form): 3rd International Conference on Cloud Computing Research and Innovation (Cloud Asia R&D 2015)
Date: received 13 Oct 2015
Contact author: praveen gauravaram at qut edu au
Available format(s): PDF | BibTeX Citation
Note: This paper has been accepted in the 3rd International Conference on Cloud Computing Research and Innovation (Cloud Asia R&D 2015) (http://www.ngp.org.sg/ICCCRI2015/?q=2015programlist).
Version: 20151014:172802 (All versions of this report)
Short URL: ia.cr/2015/995
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]