Synchronization of Transactions to Prevent Illegal Information Flow in a Role-Based Access Control Model

T. Enokido, M. Takizawa
{"title":"Synchronization of Transactions to Prevent Illegal Information Flow in a Role-Based Access Control Model","authors":"T. Enokido, M. Takizawa","doi":"10.1109/AINA.2008.145","DOIUrl":null,"url":null,"abstract":"The role-based access control (RBAC) model is widely used to make information systems secure. Even if every access request is authorized in the roles, illegal information flow might occur as the well known confinement problem. In this paper, we discuss how to prevent illegal information flow to occur by synchronizing conflicting transactions in the RBAC model. We first define types of information flow relations, legal (LIF), illegal (IIF), and possibly illegal (PIF) ones R<sub>1</sub> = R<sub>2</sub>, R<sub>1</sub> rarr R<sub>2</sub>, and R1 rarr R<sub>2</sub> among a pair of role families R\\ and Ri, respectively. Here, let T<sub>1</sub> and T<sub>2</sub> be a pair of transactions with role families R<sub>1</sub> and R<sub>2</sub> respectively. Suppose T<sub>1</sub> precedes T<sub>2</sub> in a schedule, i.e. for every pair of conflicting methods op\\ and opi from T\\ andT% respectively, op\\ is performed prior to op<sub>2</sub>- Here, if the LIF relation R<sub>1</sub> = R<sub>2</sub> holds, no illegal information flow occur. If R<sub>1</sub> rarr R<sub>2</sub>, illegal information flow necessarily occur. R<sub>1</sub> rarr R<sub>2</sub> implies that illegal information flow might occur depending on in which order the transactions perform what methods.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2008.145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

The role-based access control (RBAC) model is widely used to make information systems secure. Even if every access request is authorized in the roles, illegal information flow might occur as the well known confinement problem. In this paper, we discuss how to prevent illegal information flow to occur by synchronizing conflicting transactions in the RBAC model. We first define types of information flow relations, legal (LIF), illegal (IIF), and possibly illegal (PIF) ones R1 = R2, R1 rarr R2, and R1 rarr R2 among a pair of role families R\ and Ri, respectively. Here, let T1 and T2 be a pair of transactions with role families R1 and R2 respectively. Suppose T1 precedes T2 in a schedule, i.e. for every pair of conflicting methods op\ and opi from T\ andT% respectively, op\ is performed prior to op2- Here, if the LIF relation R1 = R2 holds, no illegal information flow occur. If R1 rarr R2, illegal information flow necessarily occur. R1 rarr R2 implies that illegal information flow might occur depending on in which order the transactions perform what methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于角色的访问控制模型中防止非法信息流的事务同步
基于角色的访问控制(RBAC)模型被广泛用于信息系统的安全。即使每个访问请求都在角色中获得授权,也可能出现非法信息流,即众所周知的限制问题。本文讨论了在RBAC模型中如何通过同步冲突事务来防止非法信息流的发生。我们首先定义信息流关系的类型,合法的(LIF),非法的(IIF)和可能非法的(PIF) R1 = R2, R1 rarr R2和R1 rarr R2分别在一对角色族R\和Ri中。这里设T1和T2分别为角色族为R1和R2的一对事务。假设调度中T1在T2之前,即对于T\和T%中每一对冲突的方法op\和opi, op\都在op2之前执行。此时,如果LIF关系R1 = R2成立,则没有非法信息流发生。若R1 rrr2,则必然发生非法信息流。R1 rarr R2意味着根据事务执行方法的顺序可能会发生非法信息流。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
STAMP: Towards A Scalable Topology Announcement and Management Protocol Analysis of Packet Relaying Models and Incentive Strategies in Wireless Ad Hoc Networks with Game Theory Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch Near Optimal Broadcasting in Optimal Triple Loop Graphs
×
引用
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