检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军信息工程大学密码工程学院,郑州450000
出 处:《计算机科学》2015年第1期159-163,共5页Computer Science
摘 要:BN(Brewer-Nash)中国墙模型对写操作有着严格的限制,它只从客体方面考虑了冲突关系,且需要事先静态划分访问区域,不适宜动态变化的系统。定义"分集"的概念,并在此基础上提出基于分集的中国墙模型,该模型能够从主体和客体两方面出发研究系统中的冲突关系,并动态地扩充访问区域。证明了该模型是冲突安全的,并通过一个实例说明了该模型的应用。The Chinese wall model gives much constraint on write permission,while its access regions need to predetermined and divided statically.Its conflict of interest relation was defined by the object's interest.A modified vision of Chinese wall was proposed to solve this problems.The divided-sets was defined and both the interest of subject and object were considered to analyze the system's conflict of interest relation.In this model,objects and subjects can be divided into different access regions which can be extended dynamically.At last,the security of this model was proved.The application of the model was showed by a simple example.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.80.203