Research Article
Secure and Verifiable Top-k Query in Two-Tiered Sensor Networks
@INPROCEEDINGS{10.1007/978-3-319-04283-1_2, author={Ting Zhou and Yaping Lin and Wei Zhang and Sheng Xiao and Jinguo Li}, title={Secure and Verifiable Top-k Query in Two-Tiered Sensor Networks}, proceedings={Security and Privacy in Communication Networks. 9th International ICST Conference, SecureComm 2013, Sydney, NSW, Australia, September 25-28, 2013, Revised Selected Papers}, proceedings_a={SECURECOMM}, year={2014}, month={6}, keywords={Two-tiered sensor networks Data confidentiality Prime aggregation Integrity Differential chain}, doi={10.1007/978-3-319-04283-1_2} }- Ting Zhou
Yaping Lin
Wei Zhang
Sheng Xiao
Jinguo Li
Year: 2014
Secure and Verifiable Top-k Query in Two-Tiered Sensor Networks
SECURECOMM
Springer
DOI: 10.1007/978-3-319-04283-1_2
Abstract
Two-tiered sensor networks have been widely adopted since they offer good scalability, efficient power usage and storage saving. Storage nodes, responsible for storing data from nearby sensors and answering queries from the sink, however, are attractive to attackers. A compromised storage node would leak sensitive data to attackers and return forged or incomplete query results to the sink. In this paper, we propose SVTQ, a Secure and Verifiable Top Query protocol that preserves both data confidentiality and integrity of query results. , we propose prime aggregation whereby storage nodes can process queries precisely without knowing actual data values. , we further propose a novel scheme called differential chain that allows the sink to verify any forged or incomplete result. Both theoretical analysis and experimental results on the real-world data set confirm the effectiveness and efficiency of SVTQ protocol.
