A dynamic mechanism for determining relationships in a partially ordered user hierarchy

Chinchen Chang, I. Lin, H. Tsai
{"title":"A dynamic mechanism for determining relationships in a partially ordered user hierarchy","authors":"Chinchen Chang, I. Lin, H. Tsai","doi":"10.1504/IJHPCN.2005.009425","DOIUrl":null,"url":null,"abstract":"In a protection system, some mechanism is needed for determining the relationship between any two users so as to be used to help the decision making requests to change access attributes. In this paper, we propose a mechanism in the partially ordered user hierarchy, instead of the tree hierarchy discussed till now, by assigning each user an interpolating polynomial constructed from the user's own id number and his fathers'. In this way, any two users' relationship can be quickly determined from evaluating their associated polynomials. Moreover, whenever a new user is added into or deleted from the user hierarchy, none or only some relevant polynomial needs to be updated, different from allover the information needs to be reconstructed as shown in the previously proposed schemes.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJHPCN.2005.009425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In a protection system, some mechanism is needed for determining the relationship between any two users so as to be used to help the decision making requests to change access attributes. In this paper, we propose a mechanism in the partially ordered user hierarchy, instead of the tree hierarchy discussed till now, by assigning each user an interpolating polynomial constructed from the user's own id number and his fathers'. In this way, any two users' relationship can be quickly determined from evaluating their associated polynomials. Moreover, whenever a new user is added into or deleted from the user hierarchy, none or only some relevant polynomial needs to be updated, different from allover the information needs to be reconstructed as shown in the previously proposed schemes.
一种动态机制,用于确定部分有序用户层次结构中的关系
在保护系统中,需要某种机制来确定任意两个用户之间的关系,以帮助决策请求更改访问属性。本文提出了一种部分有序用户层次结构的机制,该机制通过分配每个用户一个由用户自己的id号和他父亲的id号构造的插值多项式来代替目前讨论的树形层次结构。这样,任何两个用户的关系都可以通过评估他们的相关多项式来快速确定。此外,当用户层次结构中添加或删除一个新用户时,不需要更新或只需要更新一些相关的多项式,而不是像前面提出的方案那样需要重构所有的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信