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

VP2RQ: Efficient verifiable privacy-preserving range query processing in two-tiered wireless sensor networks

Author

Listed:
  • Hua Dai
  • Qingqun Ye
  • Xun Yi
  • Ruiliang He
  • Geng Yang
  • Jinji Pan

Abstract

In the field of wireless sensor networks, the secure range query technique is a challenging issue. In two-tiered wireless sensor networks, a verifiable privacy-preserving range query processing method is proposed that is based on bucket partition, information identity authentication, and check-code fusion. During the data collection process, each sensor node puts its collected data into buckets according to the bucket partition strategy, encrypts the non-empty buckets, generates the check-codes for the empty buckets, and fuses them. Then, the check-codes and the encrypted buckets are submitted to the parent node until they reach the storage node. During query processing, the base station converts the queried range into the interested bucket tag set and sends it to the storage node. The storage node determines the candidate-encrypted buckets, generates the check-code through code fusion, and sends them to the base station. The base station obtains query results and verifies the completeness of the result with the check-code. Both the theoretical analysis and experimental results show that verifiable privacy-preserving range query is capable of protecting the privacy sensor data, query result, and query range, which also supports the completeness verification of the query result. Compared to existing methods, verifiable privacy-preserving range query performs better on communication cost.

Suggested Citation

  • Hua Dai & Qingqun Ye & Xun Yi & Ruiliang He & Geng Yang & Jinji Pan, 2016. "VP2RQ: Efficient verifiable privacy-preserving range query processing in two-tiered wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 12(11), pages 15501477166, November.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:11:p:1550147716675627
    DOI: 10.1177/1550147716675627
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716675627
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147716675627?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
    ---><---

    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:12:y:2016:i:11:p:1550147716675627. 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.