Privacy-Preserving and Collusion-aware k-NN Query Processing in Two-tiered Sensor Networks

Author(s):  
Juru Zeng ◽  
Hong Chen ◽  
Weiling Lai ◽  
Ying Liu ◽  
Cuiping Li ◽  
...  
2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Hua Dai ◽  
Tianyi Wei ◽  
Yue Huang ◽  
Jia Xu ◽  
Geng Yang

Privacy-preserving data queries for wireless sensor networks (WSNs) have drawn much attention recently. This paper proposes a privacy-preserving MAX/MIN query processing approach based on random secure comparator selection in two-tiered sensor network, which is denoted by RSCS-PMQ. The secret comparison model is built on the basis of the secure comparator which is defined by 0-1 encoding and HMAC. And the minimal set of highest secure comparators generating algorithm MaxRSC is proposed, which is the key to realize RSCS-PMQ. In the data collection procedures, the sensor node randomly selects a generated secure comparator of the maximum data into ciphertext which is submitted to the nearby master node. In the query processing procedures, the master node utilizes the MaxRSC algorithm to determine the corresponding minimal set of candidate ciphertexts containing the query results and returns it to the base station. And the base station obtains the plaintext query result through decryption. The theoretical analysis and experimental result indicate that RSCS-PMQ can preserve the privacy of sensor data and query result from master nodes even if they are compromised, and it has a better performance on the network communication cost than the existing approaches.


2019 ◽  
Vol 15 (7) ◽  
pp. 155014771986100 ◽  
Author(s):  
Liang Liu ◽  
Zhenhai Hu ◽  
Lisong Wang

The existing privacy-preserving aggregation query processing methods in sensor networks rely on pre-established network topology and require all nodes in the network to participate in query processing. Maintaining the topology results in a large amount of energy overhead, and in many cases, the user is interested only in the aggregated query results of some areas in the network, and thus, the participation of the entire network node is not necessary. Aiming to solve this problem, this article proposes a spatial range aggregation query algorithm for a dynamic sensor network with privacy protection (energy-efficient privacy-preserving data aggregation). The algorithm does not rely on the pre-established topology but considers only the query area that the user is interested in, abandoning all nodes to participate in distributing the query messages while gathering the sensory data in the query range. To protect node data privacy, Shamir’s secret sharing technology is used to prevent internal attackers from stealing the sensitive data of the surrounding nodes. The analysis and experimental results show that the proposed algorithm outperforms the existing algorithms in terms of energy and privacy protection.


Sign in / Sign up

Export Citation Format

Share Document