{"title":"安全数据库设计面板","authors":"T. Hinke","doi":"10.1109/CSAC.1989.81070","DOIUrl":null,"url":null,"abstract":"It is shown that tuple-level mandatory protection and relation-level discretionary protection are adequate for supporting the security requirements of the RADC (Rome Air Development Center) homework problem, a 22-page specification for a multilevel secure database. The tuple-level granularity of control induced database decomposition to provide tuples of uniform classification. Likewise, the discretionary protection on relations induced database decomposition to meet the discretionary requirements. While there were a few examples in which tuple-level discretionary controls would have been desirable, this slight inconvenience is balanced by the lower overhead of relation level discretionary controls.<<ETX>>","PeriodicalId":284420,"journal":{"name":"[1989 Proceedings] Fifth Annual Computer Security Applications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Secure database design panel\",\"authors\":\"T. Hinke\",\"doi\":\"10.1109/CSAC.1989.81070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that tuple-level mandatory protection and relation-level discretionary protection are adequate for supporting the security requirements of the RADC (Rome Air Development Center) homework problem, a 22-page specification for a multilevel secure database. The tuple-level granularity of control induced database decomposition to provide tuples of uniform classification. Likewise, the discretionary protection on relations induced database decomposition to meet the discretionary requirements. While there were a few examples in which tuple-level discretionary controls would have been desirable, this slight inconvenience is balanced by the lower overhead of relation level discretionary controls.<<ETX>>\",\"PeriodicalId\":284420,\"journal\":{\"name\":\"[1989 Proceedings] Fifth Annual Computer Security Applications Conference\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989 Proceedings] Fifth Annual Computer Security Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSAC.1989.81070\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989 Proceedings] Fifth Annual Computer Security Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSAC.1989.81070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
It is shown that tuple-level mandatory protection and relation-level discretionary protection are adequate for supporting the security requirements of the RADC (Rome Air Development Center) homework problem, a 22-page specification for a multilevel secure database. The tuple-level granularity of control induced database decomposition to provide tuples of uniform classification. Likewise, the discretionary protection on relations induced database decomposition to meet the discretionary requirements. While there were a few examples in which tuple-level discretionary controls would have been desirable, this slight inconvenience is balanced by the lower overhead of relation level discretionary controls.<>