IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v7y2011i1p126407.html
   My bibliography  Save this article

SEF: A Secure, Efficient, and Flexible Range Query Scheme in Two-Tiered Sensor Networks

Author

Listed:
  • Jiajun Bu
  • Mingjian Yin
  • Daojing He
  • Feng Xia
  • Chun Chen

Abstract

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.

Suggested Citation

  • Jiajun Bu & Mingjian Yin & Daojing He & Feng Xia & Chun Chen, 2011. "SEF: A Secure, Efficient, and Flexible Range Query Scheme in Two-Tiered Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 7(1), pages 126407-1264, July.
  • Handle: RePEc:sae:intdis:v:7:y:2011:i:1:p:126407
    DOI: 10.1155/2011/126407
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2011/126407
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2011/126407?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:7:y:2011:i:1:p:126407. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.