{"title":"在多属性层次结构中为访问控制分配加密密钥","authors":"Bao-Chyuan Guan, Ping Wang, Yen-Fu Chen, Ray-I Chang","doi":"10.1109/CCST.2003.1297582","DOIUrl":null,"url":null,"abstract":"We consider access control in a multiattribute hierarchy and propose a new approach to assign cryptographic keys for this hierarchy. Access control through authorization is important to a high-secure system in military or government where unauthorized users are not allowed to access secret data. A real application system for the high-secure military workflow is considered. Every particular working activity in the workflow must associate multiattributes. The application system is based on the Petri net model, we define the access control problem in our system as a multiattribute hierarchy environment. A Petri net is represented by a directed, bipartite graph in which nodes are either places (represent conditions) or transitions (represent activities). A token that is located in a place signifies that its condition is true. When all the places to a transition have a token, the transition is enabled. Our problem objective is to assign suitable cryptographic keys to this multiattribute hierarchy. Based on a description on security requirements, our algorithm can verify and generate the keys automatically.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Assigning cryptographic keys to access control in a multi-attribute hierarchy\",\"authors\":\"Bao-Chyuan Guan, Ping Wang, Yen-Fu Chen, Ray-I Chang\",\"doi\":\"10.1109/CCST.2003.1297582\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider access control in a multiattribute hierarchy and propose a new approach to assign cryptographic keys for this hierarchy. Access control through authorization is important to a high-secure system in military or government where unauthorized users are not allowed to access secret data. A real application system for the high-secure military workflow is considered. Every particular working activity in the workflow must associate multiattributes. The application system is based on the Petri net model, we define the access control problem in our system as a multiattribute hierarchy environment. A Petri net is represented by a directed, bipartite graph in which nodes are either places (represent conditions) or transitions (represent activities). A token that is located in a place signifies that its condition is true. When all the places to a transition have a token, the transition is enabled. Our problem objective is to assign suitable cryptographic keys to this multiattribute hierarchy. Based on a description on security requirements, our algorithm can verify and generate the keys automatically.\",\"PeriodicalId\":344868,\"journal\":{\"name\":\"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCST.2003.1297582\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCST.2003.1297582","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assigning cryptographic keys to access control in a multi-attribute hierarchy
We consider access control in a multiattribute hierarchy and propose a new approach to assign cryptographic keys for this hierarchy. Access control through authorization is important to a high-secure system in military or government where unauthorized users are not allowed to access secret data. A real application system for the high-secure military workflow is considered. Every particular working activity in the workflow must associate multiattributes. The application system is based on the Petri net model, we define the access control problem in our system as a multiattribute hierarchy environment. A Petri net is represented by a directed, bipartite graph in which nodes are either places (represent conditions) or transitions (represent activities). A token that is located in a place signifies that its condition is true. When all the places to a transition have a token, the transition is enabled. Our problem objective is to assign suitable cryptographic keys to this multiattribute hierarchy. Based on a description on security requirements, our algorithm can verify and generate the keys automatically.