组织访问权限:最大化内部人员知识库的可用性并减轻其威胁

Qussai M. Yaseen, B. Panda
{"title":"组织访问权限:最大化内部人员知识库的可用性并减轻其威胁","authors":"Qussai M. Yaseen, B. Panda","doi":"10.1109/NSS.2010.74","DOIUrl":null,"url":null,"abstract":"This paper demonstrates how to mitigate insider threat in relational databases. Basically, it shows how the execution of the same operations in different orders poses different levels of threat. The model presented in this paper organizes accesses to data items in some sequence so that the expected threat is minimized to the lowest level. In addition, it increases the availability of data items. That is, instead of preventing insiders from getting access to some data items because of possible threat, the proposed approach reorganizes insiders’ independent requests so that they can access those data when it is determined that there is little or no threat .","PeriodicalId":127173,"journal":{"name":"2010 Fourth International Conference on Network and System Security","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Organizing Access Privileges: Maximizing the Availability and Mitigating the Threat of Insiders' Knowledgebase\",\"authors\":\"Qussai M. Yaseen, B. Panda\",\"doi\":\"10.1109/NSS.2010.74\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper demonstrates how to mitigate insider threat in relational databases. Basically, it shows how the execution of the same operations in different orders poses different levels of threat. The model presented in this paper organizes accesses to data items in some sequence so that the expected threat is minimized to the lowest level. In addition, it increases the availability of data items. That is, instead of preventing insiders from getting access to some data items because of possible threat, the proposed approach reorganizes insiders’ independent requests so that they can access those data when it is determined that there is little or no threat .\",\"PeriodicalId\":127173,\"journal\":{\"name\":\"2010 Fourth International Conference on Network and System Security\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Fourth International Conference on Network and System Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NSS.2010.74\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Fourth International Conference on Network and System Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSS.2010.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

本文阐述了如何减轻关系数据库中的内部威胁。基本上,它显示了以不同顺序执行相同的操作如何造成不同程度的威胁。本文提出的模型按照一定的顺序组织对数据项的访问,从而使预期威胁最小化。此外,它还增加了数据项的可用性。也就是说,提议的方法不是因为可能存在威胁而阻止内部人员访问某些数据项,而是重新组织内部人员的独立请求,以便他们可以在确定很少或没有威胁时访问这些数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Organizing Access Privileges: Maximizing the Availability and Mitigating the Threat of Insiders' Knowledgebase
This paper demonstrates how to mitigate insider threat in relational databases. Basically, it shows how the execution of the same operations in different orders poses different levels of threat. The model presented in this paper organizes accesses to data items in some sequence so that the expected threat is minimized to the lowest level. In addition, it increases the availability of data items. That is, instead of preventing insiders from getting access to some data items because of possible threat, the proposed approach reorganizes insiders’ independent requests so that they can access those data when it is determined that there is little or no threat .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Privacy-Preserving Protocols for String Matching The PU-Tree: A Partition-Based Uncertain High-Dimensional Indexing Algorithm Ignorant Experts: Computer and Network Security Support from Internet Service Providers Resource Selection from Distributed Semantic Web Stores A Purpose Based Access Control in XML Databases System
×
引用
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