期刊文献+

视图发布过程中信息泄漏的测量与消除 被引量:4

Measurement and Elimination of Information Disclosure in Publishing Views
下载PDF
导出
摘要 视图发布给数据交换带来了方便,但也带来了安全隐患,在视图发布过程中有可能造成信息的泄漏.因此,保证发布视图的安全成为数据库安全的一个新课题.理论上讲,防止视图发布过程中信息泄漏的方法可分为两种:一种是针对视图接受者,另一种是针对视图发布者.在实际应用中,第1种方法是很难实现的,因此,人们把研究重点都放在第2种方法上.到目前为止,人们提出了有关的评估算法和保护模型,但是它们都不能够从根本上解决问题.为了消除信息泄漏,提出了相对误差的信息泄漏测量方法,并给出了相应的算法,在此基础上,给出了一个基于关键元组的信息泄漏消除算法,并用实验证明该算法能够有效地消除信息泄漏,保证视图的安全. Although publishing views supply convenience to data exchange, it will potentially threat data owner because some information may be disclosed in the publishing process, so guaranteeing the security of the publishing views becomes a new issue of database security. Theoretically, the methods preventing the information from disclosing in the publishing process can be divided into two kinds, one is for the people who accept views, and the other is for the people who publish views. In practical applications, it is very difficult to realize the first method, so, people focus study on the second method. So far, relevant evaluating algorithms and protecting models have been proposed, for example, query answering, Kanonymity, probabilistic independence event model and so on, but all these methods have the same weakness, namely, limitation and can't eliminate information disclosure effectively, so they cannot resolve the problem completely. In order to measure the leakage of the publishing views and eliminate disclosure, an information disclosure measuring method of relative deviation is proposed, which can facilitate the information disclosure calculation, and a disclosure elimination method based on critical tuples is presented, which can eliminate the information disclosure of the publishing views completely. The experiment results show that the information disclosure measuring method of relative deviation can measure information disclosure effectively, and the information disclosure method based on critical tuples can eliminate information disclosure effectively. They can resolve the problem of information disclosure in the publishing process completely, and can guarantee the security of views in the logic level.
出处 《计算机研究与发展》 EI CSCD 北大核心 2007年第7期1227-1235,共9页 Journal of Computer Research and Development
基金 教育部科学技术研究重点基金项目(205014)
关键词 数据库安全 视图发布 信息泄漏 信息泄漏测量 信息泄漏消除 关键元组 database security view publishing information disclosure information disclosure measure information disclosure elimination critical tuple
  • 相关文献

参考文献18

  • 1L Sweeney,A model for protecting privacy[J].International Journal on Uncertainty,Fuzziness and Knowledge-BasedSystems,2002,10(5):557-570.
  • 2A Halevy.Answering queries using views:A survey[J].VLDB Journal,2001,10(4):270-294.
  • 3Wenfei Fan,Chee Yong Chan,Minos N Garofalakis.Secure XML querying with security views[C].ACM SIGMOD 2004,Paris,France,2004.
  • 4P Samarati,L Sweeney.Protecting privacy when disclosing information:k-anonymity and its enforcement through generalization and suppression[R].SRI Computer Science Laboratory,Tech Rep:SRI-CSL-98-04,1998.
  • 5L Sweeney.Achieving k-anonymity privacy protection usinggeneralization and suppressio[J].International Journal on Uncertainty,Fuzziness and Knowledge-Based Systems,2002,10(5):57-588.
  • 6G Miklau,D Sueiu.A formal analysis of information disclosure in data exchange[C].In:Proc of the 2004 ACM SIGMOD Int'l Conf on Management of Data.New York:ACM Press,2004.575-586.
  • 7D E R Denning.Cryptography and Data Security[M].London,England:Addison-Wesley Publishing Company,1982.
  • 8宋丽 刘国华.视图发布过程中信息泄漏问题的研究.计算机科学,2005,32:248-253.
  • 9宋丽 刘国华 张忠平 等.基于关键元组的信息泄漏消除算法.计算机科学,2005,32:470-472,476.
  • 10郜时红 刘国华 沈兵红 等.基于渐近概率的视图安全判定算法.计算机科学,2006,33(8):369-371.

二级参考文献43

  • 1[10]K Lefvre,D DeWitt,R Ramakrishnan.Incognito:Efficient full-domain k-anonymity.ACM SIGMOD Int'l Conf on Management of Data,Baltimore,Maryland,2005
  • 2[11]Chao Yao,Xiaoyang Sean Wang.Sushil Jajodia:Checking for k-anonymity violation by views.VLDB,Trondheim,Norway,2005
  • 3[7]L Sweeney.K-anonymity:A model for protecting privacy.International Journal on Uncertainty,Fuzziness,and Knowledge-based Systems,2002,10(5):557-570
  • 4[8]R J B JR,R Agrawal.Data privacy through optimal k-anonymization.ICDT,Edinburgh,Scotland,2005
  • 5[9]A Meyerson,R Willams.On the complexity of optimal k-anonymity.PODS,Paris,France,2004
  • 6[1]R Agrawal,R Srikant.Privacy-preserving data mining.ACM SIGMOD Conf on Management of Data,Dallas,Texas,2000
  • 7[2]L Sweeney.A model for protecting privacy.In:International Journal on Uncertainty,Fuzziness and Knowledge Based Systems,2002,10(5):557-570
  • 8[3]S J Rizvi,J R Haritsa.Maintaining data privacy in association rule mining.The 28th VLDB Conf,Hong Kong,2002
  • 9[4]T Dalenius,S Reiss.Data swapping:A technique for disclosure control.Journal of Statistical Planning and Inference,1982,6:73-85
  • 10[5]A Halevy.Answering queries using views:A survey.VLDB Journal,2001,10(4):270-294

共引文献4

同被引文献38

  • 1张坤,刘国华.基于熵的视图安全性判定[J].计算机研究与发展,2006,43(z2):122-127. 被引量:4
  • 2陈子阳,郜时红,刘国华.基于k-匿名的视图发布安全问题的研究[J].计算机研究与发展,2006,43(z2):133-139. 被引量:5
  • 3郜时红,刘国华,聂俊岚,钱颖.基于先验知识的视图发布安全问题的研究[J].计算机研究与发展,2006,43(z3):206-211. 被引量:4
  • 4杨晓春,刘向宇,王斌,于戈.支持多约束的K-匿名化方法[J].软件学报,2006,17(5):1222-1231. 被引量:60
  • 5LIU Guohua GAO Shihong.A Method of Eliminating Information Disclosure in View Publishing[J].Wuhan University Journal of Natural Sciences,2006,11(6):1753-1756. 被引量:4
  • 6Sweeney L. K-Anonymity, A model for protecting privacy [J]. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002, 10(5): 557-570
  • 7Sweeney L. Achieving k-anonymity privacy protection using generalization and suppression [J]. International Journal of Uncertainty, Fuzziness and Knowledge Based Systems, 2002, 10(5): 571-588
  • 8Sweeney L. Guaranteeing anonymity when sharing medical data: The datafly system [J]. Journal of the American Medical Informatics Association. 1997, 4(Suppl): 51-55
  • 9Hundepool A, Willenborg L. μ-and τ-argus: Software for statistical disclosure control [C]//Proc of the 3rd Int Seminar on Statistical Confidentiality. Ljubliana: Eurostat-Statistical Office of the Republic of Slovenia, 1996:208-217
  • 10Meyerson A, Williams R. On the complexity of optimal k- anonymity [C] //Proc of the ACM Syrup on Principles of Database Systems. New York: ACM, 2004:223-228

引证文献4

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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