Innovative Homomorphic Sorting of Environmental Data in Area Monitoring Wireless Sensor Networks

In many special cases, the data collected from wireless sensor networks are stored in encrypted form to provide the required privacy. Sorting is an essential operation on any stored data for orderly presentation and fast searching. In the case of cloud-stored data, sorting of the data can be delegated to the cloud server, employing suitable homomorphic encryption that supports sorting. This paper presents a new homomorphic sorting algorithm based on the Hardy-Littlewood-Polya rearrangement inequality. The associated homomorphic encryption scheme is accomplished using integer matrix keys generated based on Hermite Normal Form transformation. This work uses the homomorphic sort support encryption algorithm to securely sort the wireless sensor data stored in the cloud. Subsequently, the computation of the corresponding descriptive statistical values is securely outsourced to the Cloud Server. Our scheme saves the homomorphic sort execution time by about 30% compared to its nearest competing method.