Efficient and privacy-preserving range-max query in fog-based agricultural IoT

Smart agriculture Internet of Things (IoT) is a typical application of IoT and has become popular due to its advantages in automatic irrigation and fertilization, crop growth monitoring, pest and disease detection, etc. To reduce resource waste, minimize environmental impact, and maximize crop yield, most smart agricultural applications require to collect and process agricultural data in real-time. However, the computational and storage resources of the agricultural IoT devices are limited. To alleviate the computational and storage pressure on agriculture IoT devices and timely process the collected data collected by IoT devices, the fog node is usually placed at the edge of the agricultural IoT. Nevertheless, the fog node may not be completely trusted. The agricultural IoT devices’ data stored in the fog node will face the potential risk of privacy leakage. In this paper, to preserve the privacy of agricultural IoT devices’ data and user query’s result in the fog-based smart agriculture IoT, we first build the K2-treap, which is used for storing the data collected by agriculture IoT devices and support efficient range-max query and dynamic update of the data. Then, we design a data encryption and comparison algorithm based on BGN homomorphic encryption technique and present an efficient and privacy-preserving range-max query in the fog-based smart agriculture IoT, which can not only securely compare two data based on their ciphertexts but also support the incremental update directly over ciphertexts. Notably, our comparison technique and range-max queries are run by the fog node, so there are no interactions between the agricultural IoT devices and the fog node during the comparison and query. Finally, we conduct a detailed security analysis and performance evaluation. The results show that our proposed scheme can indeed protect the privacy of the agricultural IoT devices’ data and query results, and the experimental test results prove that our proposed scheme is efficient.