From qualitative to quantitative proofs of security properties using first-order conditional logic1
نویسندگان
چکیده
منابع مشابه
From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic: Abstract∗
Security protocols, such as key-exchange and keymanagement protocols, are short, but notoriously difficult to prove correct. Flaws have been found in numerous protocols, ranging from the the 802.11 Wired Equivalent Privacy (WEP) protocol used to protect link-layer communications from eavesdropping and other attacks [1] to standards and proposed standards for Secure Socket Layer [2], [3] to Kerb...
متن کاملA First-Order Conditional Logic with Qualitative Statistical Semantics
We define a first-order conditional logic in which conditionals, such as a —• 0, are interpreted as saying that nor-mal/commonAypical objects which satisfy a satisfy 0 as well. This qualitative 'statistical' interpretation is achievedby imposing additional structure on the domain of a single first-order model in the form of an ordering over domainelements and tuples, a —* 0 then hol...
متن کاملMechanical Proofs of Security Properties
We give a formal deenition of the notion of information ow for a simple guarded command language. We propose an axiomatisation of security properties based on this notion of information ow and we prove its soundness with respect to the operational semantics of the language. We then identify the sources of non determinism in proofs and we derive in successive steps an inference algorithm which i...
متن کاملFirst-Order Proofs for Higher-Order Languages
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....
متن کاملComposition of Web Services: From Qualitative to Quantitative Timed Properties
Dealing with service composition is an important and challenging issue of distributed systems. Existing works investigate mechanisms for analyzing and synthesizing a composition based on qualitative properties which characterize operations and/or messages choreography constraints. Apart from these qualitative properties, quantitative properties such as time related features are a crucial settin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Security
سال: 2017
ISSN: 1875-8924,0926-227X
DOI: 10.3233/jcs-15774