IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i13p1934-d1419985.html
   My bibliography  Save this article

A Range Query Scheme for Spatial Data with Shuffled Differential Privacy

Author

Listed:
  • Kaixuan Li

    (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    These authors contributed equally to this work.)

  • Hua Zhang

    (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    These authors contributed equally to this work.)

  • Yanxin Xu

    (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China)

  • Zhenyan Liu

    (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China)

Abstract

The existing high-dimensional or multi-dimensional geographic spatial datasets have a large amount of data. When third-party servers collect and publish them, privacy protection is required to prevent sensitive information from being leaked. Local differential privacy can be used to protect location-sensitive information during range queries. However, the accuracy of a range query based on local differential privacy is affected by the distribution and density of spatial data. Based on this, aiming at the distribution and density characteristics of data, we designed a d p K D tree that supports high-precision range queries with shuffled differential privacy, and designed an algorithm KDRQ for range queries based on shuffled differential privacy. First, we employed the d p K D to divide the data. Then, we shuffled the data based on S R R Q and reconstructed the tree. Finally, we used the SDRQ algorithm for the response range query. The experimental results show that the query accuracy of the KDRQ algorithm was at least 1–4.5 times higher than that of the existing algorithms RAPPOR, PSDA and GT-R under the same privacy budget.

Suggested Citation

  • Kaixuan Li & Hua Zhang & Yanxin Xu & Zhenyan Liu, 2024. "A Range Query Scheme for Spatial Data with Shuffled Differential Privacy," Mathematics, MDPI, vol. 12(13), pages 1-15, June.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:13:p:1934-:d:1419985
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/13/1934/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/13/1934/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:13:p:1934-:d:1419985. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.