Order preserving encryption for numeric data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A privacy-preserving index for range queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Secure multidimensional range queries in sensor networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Verifiable fine-grained top-k queries in tiered sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
SafeQ: secure and efficient query processing in sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed adaptive top-k monitoring in wireless sensor networks
Journal of Systems and Software
Verifiable Privacy-Preserving Sensor Network Storage for Range Query
IEEE Transactions on Mobile Computing
Exact Top-K Queries in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
Efficient and fast distributed top-k query protocol in wireless sensor networks
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
Information-theoretic modeling of false data filtering schemes in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Practical and Secure Multidimensional Query Framework in Tiered Sensor Networks
IEEE Transactions on Information Forensics and Security
Hi-index | 0.00 |
A two-tiered architecture with resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier is expected to be adopted in large scale sensor networks. In a hostile environment, adversaries are more motivated to compromise the master nodes to break the authenticity and completeness of query results, whereas it is lack of light and secure query processing protocol in tiered sensor networks at present. In this paper, we study the problem of verifiable fine-grained top-$$k$$k queries in two-tiered sensor networks, and propose a novel verification scheme, which is named Verification Scheme for Fine-grained Top-$$k$$k Queries (VSFTQ). To make top-$$k$$k query results verifiable, VSFTQ establishes relationships among data items of each sensor node using their orders, which are encrypted together with the scores of the data items and the interested time epoch number using distinct symmetric keys kept by each sensor node and the network owner. Both theoretical analysis and simulation results show that VSFTQ can not only ensure high probability of detecting forged and/or incomplete query results, but also significantly decrease the amount of verification information when compared with existing schemes.