{"title":"一种动态机制,用于确定部分有序用户层次结构中的关系","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":"{\"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}","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}
A dynamic mechanism for determining relationships in a partially ordered user hierarchy
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.