对中国隔离墙安全政策的执行限制最少

A. Sharifi, Mahesh V. Tripunitara
{"title":"对中国隔离墙安全政策的执行限制最少","authors":"A. Sharifi, Mahesh V. Tripunitara","doi":"10.1145/2462410.2462425","DOIUrl":null,"url":null,"abstract":"The Chinese Wall security policy states that information from objects that are to be confidential from one another should not flow to a subject. It addresses conflict of interest, and was first articulated in the well-cited work of Brewer and Nash, which proposes also an enforcement mechanism for the policy. Work subsequent to theirs has observed that their enforcement mechanism is overly restrictive -- authorization states in which the policy is not violated may be rendered unreachable. We present two sets of novel results in this context. In one, we present an enforcement mechanism for the policy that is simple and efficient, and least-restrictive -- an authorization state is reachable if and only if it does not violate the policy. In our enforcement mechanism, the actions of a subject can constrain the prospective actions of another, a trade-off that we show every enforcement mechanism that is least-restrictive must incur. Our other set of results is that the enforcement mechanism of Brewer-Nash is even more restrictive than previous work establishes. Specifically, we show: (1) what is called the *-rule is overspecified in that one of its sub-rules implies the other, and, (2) if a subject is authorized to write to an object that contains confidential information, then all objects that contain confidential information must belong to the same conflict of interest class. Our work sheds new light on what is generally considered to be important work in information security.","PeriodicalId":74509,"journal":{"name":"Proceedings of the ... ACM symposium on access control models and technologies. ACM Symposium on Access Control Models and Technologies","volume":"55 1","pages":"61-72"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Least-restrictive enforcement of the Chinese wall security policy\",\"authors\":\"A. Sharifi, Mahesh V. Tripunitara\",\"doi\":\"10.1145/2462410.2462425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Chinese Wall security policy states that information from objects that are to be confidential from one another should not flow to a subject. It addresses conflict of interest, and was first articulated in the well-cited work of Brewer and Nash, which proposes also an enforcement mechanism for the policy. Work subsequent to theirs has observed that their enforcement mechanism is overly restrictive -- authorization states in which the policy is not violated may be rendered unreachable. We present two sets of novel results in this context. In one, we present an enforcement mechanism for the policy that is simple and efficient, and least-restrictive -- an authorization state is reachable if and only if it does not violate the policy. In our enforcement mechanism, the actions of a subject can constrain the prospective actions of another, a trade-off that we show every enforcement mechanism that is least-restrictive must incur. Our other set of results is that the enforcement mechanism of Brewer-Nash is even more restrictive than previous work establishes. Specifically, we show: (1) what is called the *-rule is overspecified in that one of its sub-rules implies the other, and, (2) if a subject is authorized to write to an object that contains confidential information, then all objects that contain confidential information must belong to the same conflict of interest class. Our work sheds new light on what is generally considered to be important work in information security.\",\"PeriodicalId\":74509,\"journal\":{\"name\":\"Proceedings of the ... ACM symposium on access control models and technologies. ACM Symposium on Access Control Models and Technologies\",\"volume\":\"55 1\",\"pages\":\"61-72\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... ACM symposium on access control models and technologies. ACM Symposium on Access Control Models and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2462410.2462425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... ACM symposium on access control models and technologies. ACM Symposium on Access Control Models and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2462410.2462425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

“中国墙”安全策略规定,对象之间的信息不应该流向对象。它解决了利益冲突,并在布鲁尔和纳什被广泛引用的著作中首次提出,该著作还提出了一种政策的执行机制。他们之后的工作已经观察到,他们的执行机制过于严格——没有违反策略的授权状态可能变得无法访问。在此背景下,我们提出了两组新颖的结果。在一种情况下,我们提出了一种简单有效且限制最少的策略实施机制——当且仅当授权状态不违反策略时,才可以访问该状态。在我们的执行机制中,一个主体的行为可以约束另一个主体的预期行为,我们展示了约束最少的每个执行机制必须产生的权衡。我们的另一组结果是,Brewer-Nash的执行机制比之前的研究建立的更具限制性。具体来说,我们表明:(1)所谓的*-规则是过度指定的,因为它的一个子规则暗示了另一个子规则,并且(2)如果一个主体被授权写入包含机密信息的对象,那么包含机密信息的所有对象必须属于相同的利益冲突类。我们的工作揭示了通常被认为是信息安全的重要工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Least-restrictive enforcement of the Chinese wall security policy
The Chinese Wall security policy states that information from objects that are to be confidential from one another should not flow to a subject. It addresses conflict of interest, and was first articulated in the well-cited work of Brewer and Nash, which proposes also an enforcement mechanism for the policy. Work subsequent to theirs has observed that their enforcement mechanism is overly restrictive -- authorization states in which the policy is not violated may be rendered unreachable. We present two sets of novel results in this context. In one, we present an enforcement mechanism for the policy that is simple and efficient, and least-restrictive -- an authorization state is reachable if and only if it does not violate the policy. In our enforcement mechanism, the actions of a subject can constrain the prospective actions of another, a trade-off that we show every enforcement mechanism that is least-restrictive must incur. Our other set of results is that the enforcement mechanism of Brewer-Nash is even more restrictive than previous work establishes. Specifically, we show: (1) what is called the *-rule is overspecified in that one of its sub-rules implies the other, and, (2) if a subject is authorized to write to an object that contains confidential information, then all objects that contain confidential information must belong to the same conflict of interest class. Our work sheds new light on what is generally considered to be important work in information security.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sidecar-based Path-aware Security for Microservices Poster: How to Raise a Robot - Beyond Access Control Constraints in Assistive Humanoid Robots Demo: A Multimodal Behavioral Biometric Scheme for Smartphone User Authentication (MBBS) Qualitative Intention-aware Attribute-based Access Control Policy Refinement SpaceMediator: Leveraging Authorization Policies to Prevent Spatial and Privacy Attacks in Mobile Augmented Reality
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1