A Differentially private hybrid decomposition algorithm based on quad-tree

Shuyu Li

doi:10.1016/j.cose.2021.102384

A Differentially private hybrid decomposition algorithm based on quad-tree

2021-10-01

6

PRE

AI

DOI：10.1016/j.cose.2021.102384

Original

Original request for help

Save

Abstract

En 中文

Nowadays, spatial data provides users with more convenient services because of its wide application scenarios and rich content. At the same time, the collection and release of spatial data also bring risks of privacy disclosure. In this paper, a differentially private hybrid hierarchical decomposition algorithm named DP-HDAQT is proposed for privacy preserving spatial data query. Data dependent adaptive density grid decomposition is used for coarse sparse/dense region splitting at the first layer. Then for dense regions, an improved quad tree decomposition way is adopted for further sub-region splitting by introducing bias count to eliminate the impact of recursion depth on a query result. Geometric budget allocation strategy and Laplace noise are used during the decomposition process for privacy preservation. Experimental results demonstrate that the proposed algorithm achieves better accuracy of the count queries in the condition of preserving data privacy well. (C) 2021 Elsevier Ltd. All rights reserved.

Keywords:

Spatial data query

Quad-tree

Differential privacy

Recursion depth

Privacy budget

A Differentially private hybrid decomposition algorithm based on quad-tree

Abstract

AI Summary

Journal

Organization

Cited Papers