发布求助
文献互助 智能选刊 最新文献

Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy最新文献

筛选
英文 中文
A separation model for virtual machine monitors 虚拟机监视器的分离模型
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130776
N. Kelem, R. Feiertag
{"title":"A separation model for virtual machine monitors","authors":"N. Kelem, R. Feiertag","doi":"10.1109/RISP.1991.130776","DOIUrl":"https://doi.org/10.1109/RISP.1991.130776","url":null,"abstract":"A security policy is given for separation virtual machine monitors (SVMMs) and the authors interpret J.M. Rushby's (1981) separation model for SVMMs. Applying Rushby's technique yields a practical method for demonstrating that an implementation of an SVMM adheres to the abstract isolation axiom of the separation model, thus providing relatively strong assurance for a low level of effort. The authors describe the relevant characteristics of SVMMs and note the applicable formal modeling requirements. A summary of the SVMM separation model, which is a modification of the original model presented by Rushby, is given. The separation model technique permits a proof of separability among the operating systems under control of the kernel of an SVMM. An interpretation of the elements of the separation model using concepts from SVMMs is given.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131315124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 42
Protecting security information in distributed systems 保护分布式系统中的安全信息
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130792
C. Fritzner, L. Nilsen, Å. Skomedal
{"title":"Protecting security information in distributed systems","authors":"C. Fritzner, L. Nilsen, Å. Skomedal","doi":"10.1109/RISP.1991.130792","DOIUrl":"https://doi.org/10.1109/RISP.1991.130792","url":null,"abstract":"It is shown how security information for user authentication, peer-entity authentication and access control is created and utilized in large distributed systems. The protection mechanisms used are hash functions, and symmetric and asymmetric cryptography. The authors describe and combine data formats for security information based on international standards from several standardization bodies.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124180195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
An analysis of the proxy problem in distributed systems 分布式系统中的代理问题分析
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130793
V. Varadharajan, Phillip Allen, S. Black
{"title":"An analysis of the proxy problem in distributed systems","authors":"V. Varadharajan, Phillip Allen, S. Black","doi":"10.1109/RISP.1991.130793","DOIUrl":"https://doi.org/10.1109/RISP.1991.130793","url":null,"abstract":"The authors look at the problem of delegation of rights or proxy in distributed object systems. Two signature-based schemes for achieving delegation which require different inter-object trust assumptions are presented. These schemes have been instantiated using public key and secret key based cryptographic techniques. Additional trust implications which arise from these implementations are also considered. Then the authors consider the issue of revocation of delegations and propose several ways of achieving this. These solutions have been compared with the mechanism found in the Distributed System Security Architecture (M. Gasser et al., 1990). Finally, the authors consider the Kerberos authentication system (J. Steiner et al., 1988) and propose extensions to implement the delegation scheme.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"706 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116511806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 144
Reducing timing channels with fuzzy time 减少带有模糊时间的时序通道
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130768
Wei-Ming Hu
{"title":"Reducing timing channels with fuzzy time","authors":"Wei-Ming Hu","doi":"10.1109/RISP.1991.130768","DOIUrl":"https://doi.org/10.1109/RISP.1991.130768","url":null,"abstract":"Fuzzy time is a collection of techniques that reduces the bandwidths of covert timing channels by making all clocks available to a process noisy. Developed in response to the problems posed by high-speed hardware timing channels, fuzzy time has been implemented in the VAX security kernel. Fuzzy time has proven to be highly effective against the timing channels in the VAX security kernel. Not only does fuzzy time close the high-speed channels, it does so at a much lower-than-anticipated performance cost. It is believed that the VAX security kernal managed to meet the covert channel guidelines while maintaining a good balance between security and performance.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"17 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120859077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 326
Modeling nondisclosure in terms of the subject-instruction stream 根据主题-指令流对保密进行建模
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130775
James G. Williams
{"title":"Modeling nondisclosure in terms of the subject-instruction stream","authors":"James G. Williams","doi":"10.1109/RISP.1991.130775","DOIUrl":"https://doi.org/10.1109/RISP.1991.130775","url":null,"abstract":"A formal definition is given of nondisclosure for a computing system and the author describes a functional decomposition of the system into two kinds of activities, namely, the selection and execution of subject instructions. Security requirements for each of the two resulting subsystems are given, and it is proved that, if each subsystem satisfies its security requirements, then the entire system satisfies the given nondisclosure property. Finally, in order to show how security can be enforced by the system, an access-control model is given for subject-instruction processing that guarantees satisfaction of the given security requirements for subject-instruction processing.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131918207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A novel decomposition of multilevel relations into single-level relations 一种将多层关系分解为单层关系的新方法
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130797
S. Jajodia, R. Sandhu
{"title":"A novel decomposition of multilevel relations into single-level relations","authors":"S. Jajodia, R. Sandhu","doi":"10.1109/RISP.1991.130797","DOIUrl":"https://doi.org/10.1109/RISP.1991.130797","url":null,"abstract":"Presents a novel decomposition algorithm that breaks a multilevel relation into single-level relations and a novel recovery algorithm which reconstructs the original multilevel relation from the decomposed single-level relations. There are several novel aspects to these decomposition and recovery algorithms which provide substantial advantages over previous proposals. The algorithms are formulated in the context of an operational semantics for multilevel relations, defined here by generalizing the usual update operations of structured query language (SQL) to multilevel relations. The algorithms, with minor modifications, can easily accommodate alternative update semantics which have been proposed in the literature. The algorithms are efficient because recovery is based solely on union-like operations without any use of joins. The decomposition is intuitively and theoretically simple, giving a sound basis for correctness.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132247656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Microdata disclosure limitation in statistical databases: query size and random sample query control 统计数据库中的微数据披露限制:查询大小和随机样本查询控制
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130795
G. Duncan, Sumitra Mukherjee
{"title":"Microdata disclosure limitation in statistical databases: query size and random sample query control","authors":"G. Duncan, Sumitra Mukherjee","doi":"10.1109/RISP.1991.130795","DOIUrl":"https://doi.org/10.1109/RISP.1991.130795","url":null,"abstract":"A probabilistic framework can be used to assess the risk of disclosure of confidential information in statistical databases that use disclosure control mechanisms. The authors show how the method may be used to assess the strengths and weaknesses of two existing disclosure control mechanisms: the query set size restriction control and random sample query control mechanisms. Results indicate that neither scheme provides adequate security. The framework is then further exploited to analyze an alternative scheme combining query set size restriction and random sample query control. It is shown that this combination results in a significant decrease in the risk of disclosure.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128625483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 32
Covert flow trees: a technique for identifying and analyzing covert storage channels 隐蔽流树:一种识别和分析隐蔽存储通道的技术
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130770
Phillip A. Porras, R. Kemmerer
{"title":"Covert flow trees: a technique for identifying and analyzing covert storage channels","authors":"Phillip A. Porras, R. Kemmerer","doi":"10.1109/RISP.1991.130770","DOIUrl":"https://doi.org/10.1109/RISP.1991.130770","url":null,"abstract":"A technique for detecting covert storage channels using a tree structure called a covert flow tree (CFT) is introduced. By traversing the paths of a CFT a comprehensive list of scenarios that potentially support covert communication via particular resource attributes can be automatically constructed. CFTs graphically illustrate the process through which information regarding the state of one attribute is relayed to another attribute, and how in turn that information is relayed to a listening process. Algorithms for automating the construction of CFT and potential covert channel operation sequences are presented. Two example systems are analyzed and their results are compared to two other analysis techniques performed on identical systems. The CFT approach not only identified all covert storage channels found by the other techniques, but discovered a channel not detected by the other techniques.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 44
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信