Proceedings 9th IEEE Computer Security Foundations Workshop最新文献

筛选
英文 中文
Narrowing terminates for encryption 缩小终止加密
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503689
J. Millen, H. Ko
{"title":"Narrowing terminates for encryption","authors":"J. Millen, H. Ko","doi":"10.1109/CSFW.1996.503689","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503689","url":null,"abstract":"Many techniques for protocol analysis use term replacement rules to express the reduction properties of symbolic encryption operations. Some approaches must solve equations in those operators, using sequences of narrowing steps. It is shown that every infinite sequence of narrowing steps for popular abstract encryption operators has a loop, and hence there is a terminating algorithm to solve such equations by searching all sequences of narrowing steps.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115319252","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}
引用次数: 6
A Genealogy of Non-Interference 互不干涉的宗谱
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503700
P. Ryan
{"title":"A Genealogy of Non-Interference","authors":"P. Ryan","doi":"10.1109/CSFW.1996.503700","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503700","url":null,"abstract":"Non-interference is intended to capture the idea that one user’s interaction with a system should not causally effect any observations of the system that can be made by another user. Thus the latter user should be unable to infer anything from observations of the system about the actual behaviour of the former. As such it is a central concept in security modelling. Ever since Goguen and Meseguer first proposed a formalisation of the idea there has been a staggering proliferation of generalisations and alternative formulations. This, superficially very simple and intuitive idea, turns out to harbour remarkable subtleties, especially when extended to systems with non-determinism. It should be noted that the concept of non-determinism itself is very subtle and indeed at least two distinct flavours can be identified: underspecified and probabilistic, and it turns out that the distinction can be crucial from a security point of view, see for example [3]. Further elaborations of non-interference are possible if probability and/or time are introduced into the models. The utility of NI has also been questioned: it is clearly an elegant abstraction but, at least in its pure form, seems rarely to be used for real. This has prompted a number of generalisations applicable to a wider class of applications:","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121827008","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}
引用次数: 0
A class of flexible and efficient key management protocols 一类灵活高效的密钥管理协议
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503685
C. Boyd
{"title":"A class of flexible and efficient key management protocols","authors":"C. Boyd","doi":"10.1109/CSFW.1996.503685","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503685","url":null,"abstract":"Cryptographic protocols for key establishment normally include some means to allow participants to ensure that a key is new and not replayed from an old protocol run. When the key is generated by a mutually trusted server this is usually achieved by sending with the key a quantity known to be new. A different general method for achieving freshness in this content is proposed. A number of specific example protocols are given which have some practical advantages over previous published protocols.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126713347","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}
引用次数: 27
E-commerce payment protocols: requirements and analysis 电子商务支付协议:需求与分析
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503692
S. Zaba
{"title":"E-commerce payment protocols: requirements and analysis","authors":"S. Zaba","doi":"10.1109/CSFW.1996.503692","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503692","url":null,"abstract":"This panel will discuss the properties appropriate to E-Commerce protocols, principally payment protocols, and the applicability of current formal analysis techniques to the development and verification of those protocols. Some of the requirements, and non-requirements, turn out to be surprising: for example, support for repudiation disputes is affected by commercial and consumer law, and is deliberately downplayed in some protocols. Other potential requirements such as whole-protocol integrity (as opposed to individual message integrity) are not obviously modelled by many existing formal analysis tools. Protocols being deployed in practice, such as VISA/Mastercard's SET, also include a significant number of optional elements and variants, whose combinatoric interaction makes formal analysis both more tedious and more desirable. We intend to stimulate both the analysis of proposed protocols and the development of analysis formalisms.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116036816","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
Some new attacks upon security protocols 对安全协议的一些新攻击
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503701
G. Lowe
{"title":"Some new attacks upon security protocols","authors":"G. Lowe","doi":"10.1109/CSFW.1996.503701","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503701","url":null,"abstract":"Many security protocols have appeared in the literature, with aims such as agreeing upon a cryptographic key, or achieving authentication. However, many of these have been shown to be flawed. In this paper we present a number of new attacks upon security protocols, and discuss ways in which we may avoid designing incorrect protocols in the future.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131001828","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}
引用次数: 249
Towards a model of storage jamming 建立存储干扰模型
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503703
J. McDermott, D. Goldschlag
{"title":"Towards a model of storage jamming","authors":"J. McDermott, D. Goldschlag","doi":"10.1109/CSFW.1996.503703","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503703","url":null,"abstract":"Storage jamming can degrade real-world activities that share stored data. Storage jamming is not prevented by access controls or cryptographic techniques. Verification to rule out storage jamming logic is impractical for shrink-wrapped software or low-cost custom applications. Detection mechanisms do offer more promise. In this paper, we model storage jamming and a detection mechanism, using Unity logic. We find that Unity logic, in conjunction with some high-level operators, models storage jamming in a natural way and allows us to reason about susceptibility, rate of jamming, and impact on persistent values.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114452285","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}
引用次数: 48
Specifying a security policy: a case study 指定安全策略:案例研究
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503697
F. Cuppens, C. Saurel
{"title":"Specifying a security policy: a case study","authors":"F. Cuppens, C. Saurel","doi":"10.1109/CSFW.1996.503697","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503697","url":null,"abstract":"The objective of this paper is to assist the security administrators, in their attempt to specify, define and formalize security policies suited to a given high risk environment. It is then possible for the administrators to automatically derive consequences of these policies. In particular we want to provide users with the following functionalities: query a given security policy; verify that properties such as consistency and completeness are enforced by a given policy; verify that a given situation does not violate the security policy; investigate interoperability problems between several security policies. In this paper we more precisely focus on the problem of security policies formulization. We want to get a generic approach, being as much domain-independent as possible. In order to achieve the above goals, we have chosen a logic-based approach. It combines a deontic logic to model the concept of permission, obligation and prohibition with a modal logic of action. It also includes the possibility to deal with additional concepts such as role, responsibility and delegation. We illustrate this approach through a case study: a regulation whose purpose is to define means to protect secret data related to the National Defense.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128748515","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}
引用次数: 55
A logic of composition for information flow predicates 信息流谓词的组合逻辑
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503693
R. Peri, W. Wulf, D. Kienzle
{"title":"A logic of composition for information flow predicates","authors":"R. Peri, W. Wulf, D. Kienzle","doi":"10.1109/CSFW.1996.503693","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503693","url":null,"abstract":"Information flow predicates are properties of sets of traces and therefore cannot be handled under the Alpem-Schneider framework and the Abadi-Lamport Composition Principle. McLean proposed a theory (1994) to investigate the composition properties of these predicates and derived a partial order on them. In this paper we present an alternate framework based on many-sorted predicate logic for specifying the information flow properties and show that this framework can be used to reason about the composition of such properties that is amenable to automated theorem proving.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130703811","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
Simmons' protocol is not free of subliminal channels 西蒙斯的协议中也有潜意识通道
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503702
Y. Desmedt
{"title":"Simmons' protocol is not free of subliminal channels","authors":"Y. Desmedt","doi":"10.1109/CSFW.1996.503702","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503702","url":null,"abstract":"At the VIth Computer Security Foundations Workshop Simmons presented a protocol to make the Digital Signature Standard free of any subliminal channels. As Simmons has pointed out at several occasions the design of protocols is very difficult and one has claimed protocols to have certain properties, they turned out not to have. In this paper we demonstrate that Simmons' protocol is not free of any subliminal channels, by presenting a subliminal channel with a small capacity. We also discuss generalizations which imply that several already presented protocols claimed to be \"subliminal-free\" are not.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133198688","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}
引用次数: 25
Language generation and verification in the NRL protocol analyzer NRL协议分析器中的语言生成和验证
Proceedings 9th IEEE Computer Security Foundations Workshop Pub Date : 1996-03-10 DOI: 10.1109/CSFW.1996.503690
C. Meadows
{"title":"Language generation and verification in the NRL protocol analyzer","authors":"C. Meadows","doi":"10.1109/CSFW.1996.503690","DOIUrl":"https://doi.org/10.1109/CSFW.1996.503690","url":null,"abstract":"The NRL protocol analyzer is a tool for proving security properties of cryptographic protocols, and for finding flaws if they exist. It is used by having the user first prove a number of lemmas stating that infinite classes of states are unreachable, and then performing an exhaustive search on the remaining state space. One main source of difficulty in using the tool is in generating the lemmas that are to be proved. In this paper we show how we have made the test easier by automating the generation of lemmas involving the use of formal languages.","PeriodicalId":296193,"journal":{"name":"Proceedings 9th IEEE Computer Security Foundations Workshop","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121843238","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
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学术官方微信
小红书