{"title":"多层安全分布式系统的图论表述:综述","authors":"J. C. Williams, G. Dinolt","doi":"10.1109/SP.1987.10026","DOIUrl":null,"url":null,"abstract":"Research in developing formalisms for secure distributed systems reveals that a graph-theoretic model captures the fundamental notion of trust, while permitting a rigorous and elegant decomposition into lower levels of implementation. With such a model, security labels need be applied to directed edges only, not to events, ports, processes, messages, or whatever. Moreover, the usual concept of \"secure state\" does not lend itself to defining security in a distributed system, whereas our Model guarantees secure transitions in precisely this context.","PeriodicalId":123213,"journal":{"name":"1987 IEEE Symposium on Security and Privacy","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Graph-Theoretic Formulation of Multilevel Secure Distributed Systems: An Overview\",\"authors\":\"J. C. Williams, G. Dinolt\",\"doi\":\"10.1109/SP.1987.10026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Research in developing formalisms for secure distributed systems reveals that a graph-theoretic model captures the fundamental notion of trust, while permitting a rigorous and elegant decomposition into lower levels of implementation. With such a model, security labels need be applied to directed edges only, not to events, ports, processes, messages, or whatever. Moreover, the usual concept of \\\"secure state\\\" does not lend itself to defining security in a distributed system, whereas our Model guarantees secure transitions in precisely this context.\",\"PeriodicalId\":123213,\"journal\":{\"name\":\"1987 IEEE Symposium on Security and Privacy\",\"volume\":\"130 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1987 IEEE Symposium on Security and Privacy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SP.1987.10026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1987 IEEE Symposium on Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SP.1987.10026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Graph-Theoretic Formulation of Multilevel Secure Distributed Systems: An Overview
Research in developing formalisms for secure distributed systems reveals that a graph-theoretic model captures the fundamental notion of trust, while permitting a rigorous and elegant decomposition into lower levels of implementation. With such a model, security labels need be applied to directed edges only, not to events, ports, processes, messages, or whatever. Moreover, the usual concept of "secure state" does not lend itself to defining security in a distributed system, whereas our Model guarantees secure transitions in precisely this context.