Abstract: A privacy protection strategy based on Voronoi diagram division is proposed to solve the privacy problem of location. The relation between the position to be published and the sensitive position is processed by information entropy calculation, and the Voronoi diagram is established by using the lowest position of the relation as the graph center. Then, the position information to be published is replaced by the position of the graph center by using the Voronoi cell feature, so as to realize the purpose of hiding sensitive information. On the basis of information hiding and by using the principle of generalized differential privacy, a model for the sensitivity of location is proposed, and the results show that the proposed method satisfies the model. Finally, the comparative experiments further prove the advantages of the proposed method in the privacy protection ability and the availability of published data, and the experimental results are analyzed in detail.

摘要： 针对位置这一特殊数据发布的隐私问题，提出了基于Voronoi图预划分的隐私保护策略。该策略通过信息熵计算处理待发布位置与敏感位置关联关系，并利用关联最低位置作为图心建立Voronoi图。进而利用Voronoi单元格特性将待发布的位置信息替换为图心位置，以此实现敏感信息隐藏的目的。在信息隐藏的基础上，利用广义差分隐私原理，提出了基于位置发布数据的[ε]-敏感位置关联隐私模型，并证明所提出的算法能够满足该模型。最后，通过比较实验进一步证明了所提出的算法在隐私保护能力和发布数据可用性方面的优势，并对实验结果进行了详细的成因分析。

关键词: 信息技术, [&epsilon, ]-敏感位置关联, Voronoi图, 位置数据发布, 信息熵, 差分隐私