Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TIFS.2013.2291326 | IEEE Transactions on Information Forensics and Security |
Keywords | Field | DocType |
wireless sensor networks,communication complexity | Data mining,Computer science,Implementation,Verifiable secret sharing,Artificial intelligence,Philosophy of design,Telecommunication computing,Distributed computing,Query optimization,Pattern recognition,Communication complexity,Wireless sensor network,Completeness (statistics) | Journal |
Volume | Issue | ISSN |
9 | 1 | 1556-6013 |
Citations | PageRank | References |
7 | 0.49 | 30 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chia-Mu Yu | 1 | 242 | 29.59 |
| Guo-Kai Ni | 2 | 113 | 6.74 |
| Ing-Yi Chen | 3 | 215 | 23.61 |
| Erol Gelenbe | 4 | 4948 | 893.77 |
| Sy-Yen Kuo | 5 | 2304 | 245.46 |