A LDP-Based Privacy-Preserving Longitudinal and Multidimensional Range Query Scheme in IOT

• Published in: IEEE internet of things journal Vol. 11; no. 3; p. 1
• Main Authors: Ni, Yun, Li, Jinguo, Chang, Wenming, Xiao, Jifei
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.02.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Binary trees; Data privacy; Error reduction; Internet of Things; Local differential privacy; Lower bounds; Multidimensional data; Privacy; Privacy preserving; Queries; Randomized response; Range query; Sensors; Servers; Temperature sensors; Trusted third parties; Upper bounds
• ISSN: 2327-4662; 2327-4662
• DOI: 10.1109/JIOT.2023.3306003

Range queries are extensively used in various Internet of Things (IoT) applications as an essential functional requirement to provide intelligent and personalized services to users. In IoT environments, diverse types of data are generated, necessitating the design of range query schemes for multidimensional data. Privacy preservation is a key concern for range queries, leading to the proposal of several privacy-preserving solutions. However, most of these solutions are either inefficient or impractical. Moreover, existing approaches often suffer from the problem of longitudinal data privacy leakage, posing a serious threat to user privacy. Although some efforts have addressed the privacy issues of longitudinal data, practical implementations have been hesitant. To tackle these challenges, we propose a Local Differential Privacy-based (LDP) privacy-preserving scheme called the Privacy-Preserving Longitudinal and Multidimensional Range Query (PLMRQ) for IoT. Our scheme focuses on lightweight privacy preservation and eliminates the need for a trusted third party (TTP). Firstly, it is designed based on a double randomizer, ensuring effective privacy preservation of longitudinal data over time. Secondly, to mitigate excessive noise injection, PLMRQ dynamically constructs a binary tree structure by hierarchically decomposing the entire domain. Finally, through the utilization of a post-processing technique, the mean square error is efficiently reduced. Theoretical and experimental results demonstrate that the proposed PLMRQ maintains competitive utility while rigorously satisfying lneϵ1+tϵ2+1/eϵ1+etϵ2-LDP with an upper bound of ϵ1 and a lower bound of ϵ2.