Top-k Query Result Completeness Verification in Tiered Sensor Networks
File(s)06665142.pdf (2.89 MB)
Published version
Author(s)
Yu, Chia-Mu
Ni, Guo-Kai
Chen, Ing-Yi
Gelenbe, Erol
Kuo, Sy-Yen
Type
Journal Article
Abstract
Storage nodes are expected to be placed as an intermediate tier of large scale sensor networks for caching the collected sensor readings and responding to queries with benefits of power and storage saving for ordinary sensors. Nevertheless, an important issue is that the compromised storage node may not only cause the privacy problem, but also return fake/incomplete query results. We propose a simple yet effective dummy reading-based anonymization framework, under which the query result integrity can be guaranteed by our proposed verifiable top- k query (VQ) schemes. Compared with existing works, the VQ schemes have a fundamentally different design philosophy and achieve the lower communication complexity at the cost of slight detection capability degradation. Analytical studies, numerical simulations, and prototype implementations are conducted to demonstrate the practicality of our proposed methods.
Date Issued
2014-01-01
Date Acceptance
2013-11-01
Citation
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2014, 9 (1), pp.109-124
ISSN
1556-6013
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Start Page
109
End Page
124
Journal / Book Title
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
Volume
9
Issue
1
Copyright Statement
© 2013 IEEE. This article is Open Access.
Identifier
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000332456600010&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
Subjects
Science & Technology
Technology
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Computer Science
Engineering
Sensor networks
query result completeness
authentication
PRIVACY
ATTACKS
DEFENSE
Publication Status
Published
Date Publish Online
2013-11-14