Abstract
The structured data collected by the Internet of Things can be encrypted for protecting the user’s privacy. Range query can be used to get the expected data with some specific attributes among the encrypted data, that is, given the upper and lower limits <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$(x, y)$</tex-math></inline-formula> of a certain attribute, the range query will get all the records whose corresponding attribute values are in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$(x, y)$</tex-math></inline-formula> . However, in the structured encryption scheme with range query, there is a certain amount of information leakage, which will lead to the so-called inference attacks, i.e., the attacker can obtain the user’s attribute values. To hide attribute values and their relationship, this article transformed the problem of the numerical comparison between two attribute values into the problem of the intersection of two sets. By using the Bloom filter, the elements in the attribute value collection are recorded and determined whether the intersection of the two sets is empty. This ensures that our scheme effectively resists inference attacks. Besides, by multiplying the endpoints of the range interval by a large number, we gave an improved scheme to hide the user’s search pattern. In the query process, our scheme will not leak the upper and lower limits of the range value and will not leak the relationship between the attribute value and the range interval. This will prevent the attacker from inducing the relationship of attribute values by multiple range queries. Finally, we conducted a simulation evaluation of the scheme by using the published novel coronavirus pneumonia data, and the results show that our scheme has a better performance than the existing schemes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.