基于属性的高效自底向上访问控制策略挖掘。

Tanay Talukdar, Gunjan Batra, Jaideep Vaidya, Vijayalakshmi Atluri, Shamik Sural
{"title":"基于属性的高效自底向上访问控制策略挖掘。","authors":"Tanay Talukdar,&nbsp;Gunjan Batra,&nbsp;Jaideep Vaidya,&nbsp;Vijayalakshmi Atluri,&nbsp;Shamik Sural","doi":"10.1109/CIC.2017.00051","DOIUrl":null,"url":null,"abstract":"<p><p>Attribute Based Access Control (ABAC) is fast replacing traditional access control models due to its dynamic nature, flexibility and scalability. ABAC is often used in collaborative environments. However, a major hurdle to deploying ABAC is to precisely configure the ABAC policy. In this paper, we present an <i>ABAC mining</i> approach that can automatically discover the appropriate ABAC policy rules. We first show that the ABAC mining problem is equivalent to identifying a set of <i>functional dependencies</i> in relational databases that cover all of the records in a table. We also propose a more efficient algorithm, called ABAC-SRM which discovers the most general policy rules from a set of candidate rules. We experimentally show that ABAC-SRM is accurate and significantly more efficient than the existing state of the art.</p>","PeriodicalId":92467,"journal":{"name":"... IEEE Conference on Collaboration and Internet Computing. IEEE Conference on Collaboration and Internet Computing","volume":"2017 ","pages":"339-348"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/CIC.2017.00051","citationCount":"23","resultStr":"{\"title\":\"Efficient bottom-up Mining of Attribute Based Access Control Policies.\",\"authors\":\"Tanay Talukdar,&nbsp;Gunjan Batra,&nbsp;Jaideep Vaidya,&nbsp;Vijayalakshmi Atluri,&nbsp;Shamik Sural\",\"doi\":\"10.1109/CIC.2017.00051\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Attribute Based Access Control (ABAC) is fast replacing traditional access control models due to its dynamic nature, flexibility and scalability. ABAC is often used in collaborative environments. However, a major hurdle to deploying ABAC is to precisely configure the ABAC policy. In this paper, we present an <i>ABAC mining</i> approach that can automatically discover the appropriate ABAC policy rules. We first show that the ABAC mining problem is equivalent to identifying a set of <i>functional dependencies</i> in relational databases that cover all of the records in a table. We also propose a more efficient algorithm, called ABAC-SRM which discovers the most general policy rules from a set of candidate rules. We experimentally show that ABAC-SRM is accurate and significantly more efficient than the existing state of the art.</p>\",\"PeriodicalId\":92467,\"journal\":{\"name\":\"... IEEE Conference on Collaboration and Internet Computing. IEEE Conference on Collaboration and Internet Computing\",\"volume\":\"2017 \",\"pages\":\"339-348\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1109/CIC.2017.00051\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"... IEEE Conference on Collaboration and Internet Computing. IEEE Conference on Collaboration and Internet Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIC.2017.00051\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2017/12/14 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"... IEEE Conference on Collaboration and Internet Computing. IEEE Conference on Collaboration and Internet Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIC.2017.00051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2017/12/14 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

基于属性的访问控制(ABAC)以其动态性、灵活性和可扩展性迅速取代传统的访问控制模型。ABAC通常用于协作环境。然而,部署ABAC的一个主要障碍是精确配置ABAC策略。在本文中,我们提出了一种ABAC挖掘方法,可以自动发现合适的ABAC策略规则。我们首先说明,ABAC挖掘问题等同于识别关系数据库中覆盖表中所有记录的一组功能依赖项。我们还提出了一种更有效的算法,称为ABAC-SRM,它从一组候选规则中发现最通用的策略规则。我们的实验表明,ABAC-SRM是准确的和显着提高效率比现有的艺术状态。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient bottom-up Mining of Attribute Based Access Control Policies.

Attribute Based Access Control (ABAC) is fast replacing traditional access control models due to its dynamic nature, flexibility and scalability. ABAC is often used in collaborative environments. However, a major hurdle to deploying ABAC is to precisely configure the ABAC policy. In this paper, we present an ABAC mining approach that can automatically discover the appropriate ABAC policy rules. We first show that the ABAC mining problem is equivalent to identifying a set of functional dependencies in relational databases that cover all of the records in a table. We also propose a more efficient algorithm, called ABAC-SRM which discovers the most general policy rules from a set of candidate rules. We experimentally show that ABAC-SRM is accurate and significantly more efficient than the existing state of the art.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Seven Samurai Collaboration Second Interlude Provider Networks in the Neonatal Intensive Care Unit Associate with Length of Stay. Efficient bottom-up Mining of Attribute Based Access Control Policies.
×
引用
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