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

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

筛选
英文 中文
Storage channels in disk arm optimization 存储通道在磁盘臂优化
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130771
P. Karger, J. Wray
{"title":"Storage channels in disk arm optimization","authors":"P. Karger, J. Wray","doi":"10.1109/RISP.1991.130771","DOIUrl":"https://doi.org/10.1109/RISP.1991.130771","url":null,"abstract":"The covert storage channels found in disk I/O optimization schemes are studied. The authors examine the source of the problems in the context of various disk architectures, propose several classes of generic solutions and conclude with recommendations for future storage-system architectures. The work was done as part of the covert channel analysis for Digital's VAX security kernel. >","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"12 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":"115356628","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}
引用次数: 52
Toward an approach to measuring software trust 一种度量软件信任的方法
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130788
E. Amoroso, Thu Nguyen, J. Weiss, John Watson, Pete Lapiska, Terry Starr
{"title":"Toward an approach to measuring software trust","authors":"E. Amoroso, Thu Nguyen, J. Weiss, John Watson, Pete Lapiska, Terry Starr","doi":"10.1109/RISP.1991.130788","DOIUrl":"https://doi.org/10.1109/RISP.1991.130788","url":null,"abstract":"The authors have been involved in the development of an approach to measuring the trust of software, at some state in the software development life cycle. The primary emphasis has been on the use of well-known and generally accepted security and software engineering principles as a means for establishing software trust. A description of the critical issues related to software trust is provided here. A set of criteria classes consisting of various trust principle combinations is shown to provide a scale for measuring and comparing trust. The System V/MLS secure operating system development approach is used to demonstrate the effect of trust principles in a practical setting.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"9 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":"131027069","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
The Turing Test and non-information flow 图灵测试和非信息流
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130804
Randy Brown
{"title":"The Turing Test and non-information flow","authors":"Randy Brown","doi":"10.1109/RISP.1991.130804","DOIUrl":"https://doi.org/10.1109/RISP.1991.130804","url":null,"abstract":"Shows how the Turing Test provides a very simple yet very general characterization of non-information flow in multilevel information systems. Despite its conceptual simplicity, the Turing Test provides the study of information flow with an extremely useful notion which seems to be a significant departure from other current information flow theories. Turing's powerful idea is that information entropy is represented as uncertainty about the mathematical definition of a system, rather than as some function of the direct behavior of the system.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"75 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":"121963690","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}
引用次数: 22
The use of logic in the analysis of cryptographic protocols 逻辑在密码协议分析中的应用
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130784
P. Syverson
{"title":"The use of logic in the analysis of cryptographic protocols","authors":"P. Syverson","doi":"10.1109/RISP.1991.130784","DOIUrl":"https://doi.org/10.1109/RISP.1991.130784","url":null,"abstract":"Logics for cryptographic protocol analysis are presented, and a study is made of the protocol features that they are appropriate for analyzing: some are appropriate for analyzing trust, others security. It is shown that both features can be adequately captured by a single properly designed logic. The goals and capabilities of M. Burrows, M. Abadi and R. Needham's (1989) BAN logic are examined. It is found that there is confusion about these. While the logic is extremely useful heuristically, as a formal method it is seen to be ultimately unacceptable. Formal semantics is explored as a reasoning tool and the importance of soundness and completeness for protocol security is discussed. The KPL logic is used to resolve a debate over an alleged flaw in BAN logic and is shown to be uniquely capable of dealing with certain protocol security issues.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"1 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":"129785548","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}
引用次数: 101
Applying a theory of modules and interfaces to security verification 将模块和接口理论应用于安全验证
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130782
S. Lam, A. Shankar, Thomas Y. C. Woo
{"title":"Applying a theory of modules and interfaces to security verification","authors":"S. Lam, A. Shankar, Thomas Y. C. Woo","doi":"10.1109/RISP.1991.130782","DOIUrl":"https://doi.org/10.1109/RISP.1991.130782","url":null,"abstract":"An overview is given of a theory of modules and interfaces applicable to the specification and verification of systems with a layered architecture. At the heart of this theory is a module composition theorem. The theory is applied to the specification of a distributed system consisting of subjects and objects in different hosts (computers). Formal specifications of a user interface and a network interface are given. Access to objects, both local and remote, offered by the distributed system is proved to be multilevel secure.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"1 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":"127422588","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}
引用次数: 9
Variable noise effects upon a simple timing channel 可变噪声对简单时序通道的影响
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130803
I. S. Moskowitz
{"title":"Variable noise effects upon a simple timing channel","authors":"I. S. Moskowitz","doi":"10.1109/RISP.1991.130803","DOIUrl":"https://doi.org/10.1109/RISP.1991.130803","url":null,"abstract":"Investigates the effects of noise upon a simple timing channel. Shannon's information theory (C. Shannon et al., 1949) is used to quantify the resulting information flow across the channel. In particular the author studies how a probabilistic response time to a query by a low user affects the mutual information and channel capacity. He claims that we will never eliminate all covert channels in a multi-user computer system without serious degradation of performance. Therefore, it is important to know how 'bad' the covert channels are. One way to do this is through an information theoretic capacity analysis.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"14 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":"121059229","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}
引用次数: 19
Intrusion tolerance in distributed computing systems 分布式计算系统中的入侵容忍
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130780
Y. Deswarte, L. Blain, J. Fabre
{"title":"Intrusion tolerance in distributed computing systems","authors":"Y. Deswarte, L. Blain, J. Fabre","doi":"10.1109/RISP.1991.130780","DOIUrl":"https://doi.org/10.1109/RISP.1991.130780","url":null,"abstract":"An intrusion-tolerant distributed system is a system which is designed so that any intrusion into a part of the system will not endanger confidentiality, integrity and availability. This approach is suitable for distributed systems, because distribution enables isolation of elements so that an intrusion gives physical access to only a part of the system. In particular, the intrusion-tolerant authentication and authorization servers enable a consistent security policy to be implemented on a set of heterogeneous, untrusted sites, administered by untrusted (but nonconspiring) people. The authors describe how some functions of distributed systems can be designed to tolerate intrusions. A prototype of the persistent file server presented has been successfully developed and implemented as part of the Delta-4 project of the European ESPRIT program.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"37 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":"115753097","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}
引用次数: 268
Discretionary access controls in a high-performance object management system 高性能对象管理系统中的自由访问控制
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130796
U. Kelter
{"title":"Discretionary access controls in a high-performance object management system","authors":"U. Kelter","doi":"10.1109/RISP.1991.130796","DOIUrl":"https://doi.org/10.1109/RISP.1991.130796","url":null,"abstract":"A method for efficiently implementing access control lists (ACLs) in the main memory object-oriented database systems (OODBSs) is proposed. The main features of the method are the following: ACLs are not stored directly, but via ACL numbers; and each process has a cache which records results of evaluations of ACLs for this process and certain ACL numbers. The particular implementation of ACL numbers in the High-Performance Portable Common Tool Environment (H-PCTE) is considered, and a set of measures which speed up access controls in the most time-critical data manipulation operations is presented. The author then compares the proposed method with other approaches, and discusses whether and how the proposed method can be used to implement ACLs in a disc-oriented system.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"9 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":"121257688","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}
引用次数: 14
An analysis of covert timing channels 隐蔽时序信道分析
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130767
J. Wray
{"title":"An analysis of covert timing channels","authors":"J. Wray","doi":"10.1109/RISP.1991.130767","DOIUrl":"https://doi.org/10.1109/RISP.1991.130767","url":null,"abstract":"Covert channels have traditionally been categorized as either storage channels or timing channels. The author questions this categorization, and discusses channels that cannot be clearly identified as either storage or timing channels, but have aspects of both. A new model of timing channels is presented, which allows for channels that have characteristics of both storage channels and timing channels, and a method is given for constructing all channels in a computer system that have timing channel characteristics. Since R.A. Kemmerer's (1982) shared resource matrix methodology has the potential to detect all channels that have storage characteristics, the two methods jointly have the capability to construct all channels in a computer system. The approach to timing channels provides a justification of specific mechanisms for reducing their bandwidth which were employed in the VAX Virtual Machine Monitor.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"1 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":"124873477","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}
引用次数: 221
Verification of secure distributed systems in higher order logic: A modular approach using generic components 高阶逻辑中安全分布式系统的验证:使用通用组件的模块化方法
Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy Pub Date : 1991-05-20 DOI: 10.1109/RISP.1991.130781
J. Alves-Foss, K. Levitt
{"title":"Verification of secure distributed systems in higher order logic: A modular approach using generic components","authors":"J. Alves-Foss, K. Levitt","doi":"10.1109/RISP.1991.130781","DOIUrl":"https://doi.org/10.1109/RISP.1991.130781","url":null,"abstract":"A generalization of D. McCullough's (1987; 1988) restrictiveness model is given as the basis for providing security properties for distributed system designs. This generalization is mechanized for an event-based model of computer systems in the HOL (higher order logic) system to prove the composability of the model and several other properties about the model. A set of generalized classes of system components is developed and it is shown for which families of user views they satisfy the model. Using these classes, a collection of general system components that are specializations of one of these classes is delineated and it is shown that the specializations also satisfy the security property. A sample distributed secure system is presented along with an example of how the proposed mechanized verification system can be used to verify such designs.<<ETX>>","PeriodicalId":445112,"journal":{"name":"Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy","volume":"1 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":"129941356","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}
引用次数: 10
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信