A Novel Verification Scheme for Fine-Grained Top-k Queries in Two-Tiered Sensor Networks

Ma, Xiaomin; Song, Hong; Wang, Jianxin; Gao, Jianliang; Min, Geyong

doi:10.1007/s11277-013-1360-0

Cited by 17 publications

(20 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The security issues are the hot spots in data query researches, such as privacy protection, integrity, or completeness verification. Recently, the secure range query [5][6][7][8][9][10][11] and top-k query [12][13][14][15][16][17] have been broadly studied. However, there are limited researches on MAX/MIN query, and only [18,19] propose solutions of privacy-preserving MAX/MIN query in TWSN.…”

Section: Related Workmentioning

confidence: 99%

“…The verification code which embeds ordered and adjacent relationships of the collected data by HMAC is utilized in [14] to achieve the verifiable top-k query processing. The symmetric encryption is applied in [15] to reduce the communication cost in verifiable top-k query processing. Works in [12][13][14][15] merely support the completeness and authenticity verification of query results, but they cannot achieve privacy protection.…”

Section: Related Workmentioning

confidence: 99%

“…The symmetric encryption is applied in [15] to reduce the communication cost in verifiable top-k query processing. Works in [12][13][14][15] merely support the completeness and authenticity verification of query results, but they cannot achieve privacy protection. To preserve privacy, the privacy-preserving top-k query processing approaches based on Order Preserving Encryption [22] are proposed in [16,17].…”

Section: Related Workmentioning

confidence: 99%

“…Network Models. We consider a similar TWSN model as in [5][6][7][8][9][10][11][12][13][14][15][16][17], as shown in Figure 1. The network is divided into multiple cells, each containing master node M and several sensor nodes { 1 , 2 , .…”

Section: Models and Problem Statementmentioning

confidence: 99%

See 3 more Smart Citations

Random Secure Comparator Selection Based Privacy-Preserving MAX/MIN Query Processing in Two-Tiered Sensor Networks

et al. 2016

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Models and Problem Statementmentioning

confidence: 99%

See 2 more Smart Citations

Random Secure Comparator Selection Based Privacy-Preserving MAX/MIN Query Processing in Two-Tiered Sensor Networks

et al. 2016

View full text Add to dashboard Cite

show abstract

“…Public-key operations (both software and hardware implementations), albeit computationally feasible [5,6], consume energy approximately three orders of magnitude higher than symmetric key encryption [7]. Therefore, in the last few years, different key distribution schemes using symmetric key algorithms have been developed for SNs [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26].…”

Section: Introductionmentioning

confidence: 99%

A New Key Predistribution Scheme for Multiphase Sensor Networks Using a New Deployment Model

Zhou

Wang

et al. 2014

Journal of Sensors

Self Cite

View full text Add to dashboard Cite

During the lifecycle of sensor networks, making use of the existing key predistribution schemes using deployment knowledge for pairwise key establishment and authentication between nodes, a new challenge is elevated. Either the resilience against node capture attacks or the global connectivity will significantly decrease with time. In this paper, a new deployment model is developed for multiphase deployment sensor networks, and then a new key management scheme is further proposed. Compared with the existing schemes using deployment knowledge, our scheme has better performance in global connectivity, resilience against node capture attacks throughout their lifecycle.

show abstract

SET: Secure and Efficient Top-k Query in Two-Tiered Wireless Sensor Networks

et al. 2017

View full text Add to dashboard Cite

A Novel Verification Scheme for Fine-Grained Top-k Queries in Two-Tiered Sensor Networks

Cited by 17 publications

References 18 publications

Random Secure Comparator Selection Based Privacy-Preserving MAX/MIN Query Processing in Two-Tiered Sensor Networks

Random Secure Comparator Selection Based Privacy-Preserving MAX/MIN Query Processing in Two-Tiered Sensor Networks

A New Key Predistribution Scheme for Multiphase Sensor Networks Using a New Deployment Model

SET: Secure and Efficient Top-k Query in Two-Tiered Wireless Sensor Networks

Contact Info

Product

Resources

About