期刊文献+

无线音乐业务敏感数据保护技术研究 被引量:2

Research on wireless music business sensitive data protection technology
下载PDF
导出
摘要 中国移动无线音乐基地从2005年创立至今,得到了飞速的发展,目前用户规模超过1亿,在业务快速发展的同时,如何保护好上亿用户的个人敏感数据,成为音乐基地信息安全管理的一个重大课题。本文结合音乐基地个人敏感信息的特点和网络系统架构的实际,综合运用业务应用敏感数据检测等技术,探索实现了一种保护音乐基地敏感数据的方法。 China Mobile Wireless Music Base was founded in 2005, has been rapid development, at present the user scale more than 100,000,000, in the rapid development of the business, how to protect sensitive personal data of millions of users, has become an important research topic music base for information security management. In this paper, sensitive personal information music base characteristics and the actual network system architecture, comprehensive use of business application of sensitive data detection technology, exploring music base to achieve a kind of protection sensitive data.
作者 杨雪涛
出处 《电信工程技术与标准化》 2013年第12期55-59,共5页 Telecom Engineering Technics and Standardization
关键词 信息安全 敏感数据 数据保护 information security sensitive data data protection
  • 相关文献

参考文献4

二级参考文献42

  • 1杨晓春,刘向宇,王斌,于戈.支持多约束的K-匿名化方法[J].软件学报,2006,17(5):1222-1231. 被引量:60
  • 2刘喻,吕大鹏,冯建华,周立柱.数据发布中的匿名化技术研究综述[J].计算机应用,2007,27(10):2361-2364. 被引量:6
  • 3SWEENY L. K-anonymity:a model for protecting privacy[J].International Journal on Uncertainty Fuzziness and Knowledge-Based Systems,2002,(05):557-570.
  • 4Samarati P,Sweeney L. Generalizing data to provide anonym-ity when disclosing information[A].Seattle,Washington,1998.188.
  • 5Samarati P,Sweeney L. Generalizing data to provide anonymity when disclosing information[A].New York:acm Press,1998.188.
  • 6Sweeney L. Computational disclosure control:a primer on data privacy protection[D].Massachusetts Institute of Technology,2001.67-82.
  • 7Sweeney L. k-anonymity:A model for protecting privacy[J].International Journal on Uncertainty Fuzziness and Knowledge Based Systems,2002,(05):557-570.
  • 8Sweeney L. Achieving k-anonymity privacy protection using generalization and suppression[J].International Journal on Uncertainty Fuzziness and Knowledge-based Systems,2002,(05):571-588.
  • 9Aggarwal G,Feder T,Kenthapadi K. k-anonymity:algorithms and hardness[R].Stanford University,2004.
  • 10Meyerson A,Williams R. On the complexity of optimal k-anonymity[A].Acm Press,2004.223-228.

共引文献11

同被引文献5

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部