CAJ | 학술논문

针对基于传统的k-匿名模型下移动用户轨迹数据发布隐私保护算法有可能将相似度极高的轨迹匿名在同一个匿名集中从而导致可能出现的用户个人隐私泄露风险的不足。设计了一种新的轨迹数据发布隐私保护算法。该算法基于k-匿名模型，将轨迹所在的二维空间划分成大小相等的单元格，之后将由轨迹数据得到对应轨迹经过的单元格序列，从而定义轨迹k-匿名下的l-差异性，算法在满足k-匿名模型的前提下通过聚类的方法构建匿名集，并保证匿名集中的轨迹满足l-差异性标准，以达到降低由于差异性不足引起用户隐私泄露的风险的目的。实验结果表明，该算法是可行有效的。
침대기우전통적k-닉명모형하이동용호궤적수거발포은사보호산법유가능장상사도겁고적궤적닉명재동일개닉명집중종이도치가능출현적용호개인은사설로풍험적불족。설계료일충신적궤적수거발포은사보호산법。해산법기우k-닉명모형，장궤적소재적이유공간화분성대소상등적단원격，지후장유궤적수거득도대응궤적경과적단원격서렬，종이정의궤적k-닉명하적l-차이성，산법재만족k-닉명모형적전제하통과취류적방법구건닉명집，병보증닉명집중적궤적만족l-차이성표준，이체도강저유우차이성불족인기용호은사설로적풍험적목적。실험결과표명，해산법시가행유효적。
Based on k-anonymity model, the traditional algorithm which protects mobile objects’trajectory data when they are publishing has a possibility of leaking the objects’personal privacy. To solve this problem, this thesis designs a new kind of algorithm which can protect trajectory data privacy when publishing. This algorithm is based on k-anonymity, divides the two-dimensional space into cells of equal size, defines the standard of l-diversity under trajectory, structures anonymous set via clustering under the premise of k-anonymity model and makes sure that the trajectories which gather anonymously meet the standard of l-diversity so as to minimize the risk of leaking user’s privacy that caused by the lack of diversity. The experimental results show that this algorithm is feasible and effective.