This paper proposes concentrated geo-privacy (CGP), a privacy notion that can be considered as the counterpart of concentrated differential privacy (CDP) for geometric data. Compared with the previous notion of geo-privacy [ABCP13, CABP13], which is the counterpart of standard differential privacy, CGP offers many benefits including simplicity of the mechanism, lower noise scale in high dimensions, and better composability known as advanced composition. The last one is the most important, as it allows us to design complex mechanisms using smaller building blocks while achieving better utilities. To complement this result, we show that the previous notion of geo-privacy inherently does not admit advanced composition even using its approximate version. Next, we study three problems on private geometric data: the identity query, k nearest neighbors, and convex hulls. While the first problem has been previously studied, we give the first mechanisms for the latter two under geo-privacy. For all three problems, composability is essential in obtaining good utility guarantees on the privatized query answer.

翻译：本文提出集中地理隐私（CGP），这一隐私概念可视为集中差分隐私（CDP）在几何数据上的对应物。与先前的地理隐私概念[ABCP13, CABP13]（标准差分隐私的对应物）相比，CGP具有诸多优势，包括机制简洁性、高维度下更低的噪声尺度，以及更优的复合性（即高级复合）。其中最后一点最为重要，因为它允许我们利用更小的构建模块设计复杂机制，同时获得更优的效用。为补充这一结论，我们证明先前的地理隐私概念即使采用近似版本也本质不支持高级复合。接下来，我们研究几何数据隐私中的三个问题：身份查询、k近邻和凸包。尽管第一个问题已有研究，我们首次给出后两者在地理隐私下的机制。对于所有三个问题，复合性对于在私有化查询答案上获得良好效用保障至关重要。