SEF: A Secure, Efficient, and Flexible Range Query Scheme in Two-Tiered Sensor Networks
Author(s) -
Jiajun Bu,
Mingjian Yin,
Daojing He,
Feng Xia,
Chun Chen
Publication year - 2011
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2011/126407
Subject(s) - computer science , range query (database) , wireless sensor network , encryption , node (physics) , scheme (mathematics) , data integrity , computer network , distributed computing , tree (set theory) , sargable , database , web search query , search engine , information retrieval , mathematical analysis , mathematics , structural engineering , engineering
Large-scale wireless sensor networks follow the two-tiered architecture, where master nodes take charge of storing data and processing queries. However, if a master node is compromised, the information stored in it may be exposed, and query results can be juggled. This paper presents a novel scheme called SEF for secure range queries. To preserve privacy, SEF employs the order-preserving symmetric encryption which not only supports efficient range queries, but also maintains a strong security standard. To preserve authenticity and integrity of query results, we propose a novel data structure called Authenticity & Integrity tree. Moreover, SEF is flexible since it allows users to include or exclude the authenticity and integrity guarantee. To the best of our knowledge, this paper is the first to use the characteristic of NAND flash to achieve high storage utilization and query processing efficiency. The efficiency of the proposed scheme is demonstrated by experiments on real sensor platforms. © 2011 Jiajun Bu et al.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom