| 注册
首页|期刊导航|南京邮电大学学报(自然科学版)|一种个性化的k-匿名位置隐私保护算法

一种个性化的k-匿名位置隐私保护算法

何康 吴蒙

南京邮电大学学报(自然科学版)2012,Vol.32Issue(6):69-73,5.
南京邮电大学学报(自然科学版)2012,Vol.32Issue(6):69-73,5.

一种个性化的k-匿名位置隐私保护算法

Protecting Location Privacy with Personalized k-anonymity

何康 1吴蒙1

作者信息

  • 1. 南京邮电大学计算机学院,江苏南京210023
  • 折叠

摘要

Abstract

This paper presents a new k-anonymity algorithm based on the personalized it-anonymity model. Increasing anonymous group of anonymous memory modules in the ordinary algorithm speeds up the anonymous speed. Simulation results show that when the user' s requireements for high security situations,the proposed algorithm has faster anonymity speed compared to the ordinary anonymous algorithm, meanwhile the success rate of anonymity has also been improved. When users have the low security requirements, the proposed algorithm has slower anonymous speed than the normal algorithm, advantages of the success rate were not evident.

关键词

k-匿名/个性k-匿名/匿名群

Key words

k-anonymity/personalized k-anonymity/clique

分类

信息技术与安全科学

引用本文复制引用

何康,吴蒙..一种个性化的k-匿名位置隐私保护算法[J].南京邮电大学学报(自然科学版),2012,32(6):69-73,5.

基金项目

国家重点基础研究发展计划(973计划)(2011CB302903)资助项目 (973计划)

南京邮电大学学报(自然科学版)

OA北大核心CSTPCD

1673-5439

访问量0
|
下载量0
段落导航相关论文