{"title":"基于属性的高效自底向上访问控制策略挖掘。","authors":"Tanay Talukdar, Gunjan Batra, Jaideep Vaidya, Vijayalakshmi Atluri, 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, Gunjan Batra, Jaideep Vaidya, Vijayalakshmi Atluri, 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}
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.