检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:宋金玲[1,2] 李芳玲[3] 刘国华[2,4] 黄立明[1] 张广斌[1] 王丹丽[2]
机构地区:[1]河北科技师范学院,秦皇岛066004 [2]燕山大学信息科学与工程学院,秦皇岛066004 [3]山东理工职业学院信息工程系,济宁272017 [4]东华大学计算机科学与技术学院,上海201620
出 处:《计算机科学》2011年第9期158-163,167,共7页Computer Science
基 金:国家自然科学基金(60773100;61070032);河北省自然科学基金(F2009000475);河北科技师范学院科研创新团队建设经费(CXTD2010-05)资助
摘 要:视图发布的动态性和连续性使得视图间互相联系和影响。静态视图安全研究无法适应实际应用,如何保证动态视图的安全发布亟待解决。为了解决这个问题,首先提出了可能世界构造方法和隐私泄露概率计算方法,并给出了各种视图合并情况下的隐私泄露概率计算公式。然后,从相对安全的角度出发,给出了动态视图的安全判定公式。在此基础上,给出了动态视图的安全发布方法。所提方法能保证相对安全基础上的最大程度视图发布。Views can restrict database access on specifically attributes and tuples,so publishing views can reduce the possiblity of privacy disclosure.Howevere,the data owner will publish various views based on different application on different time,the dynamic and continuity of view dissemination made mutual contact and mutual influence among views.Considering the privacy disclosure of the publishing views themselves,which called static privacy disclosure,can not measure the disclosure accurately and can not adapt to the practical application,how to guarantee the security of the dynamic views dissemination must be resolved.To solve this problem,at first,the construction method of possible worlds and calculation method of privacy disclosure probability were propoded,and the calculating formulas of privacy disclosure probability under differrent conditions of views merging were presented.Then,the security determination formula for dynamic views was proposed from the point of relative sefe of view.Based on this,the safety dissemination method for dynamic views was presented,which can guarantee maximum level of views publishing upon relatively safe.
分 类 号:TP309.2[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.79