Refinement operators and information flow security

Bossi, Annalisa; Focardi, Riccardo; Piazza, Carla; Rossi, Sabina

doi:10.1109/sefm.2003.1236206

Cited by 24 publications

(35 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have also investigated the use of our construction in other frameworks where the satisfaction condition fails for unrestricted signature morphisms, the result being that the implications of our constructions are methodologically undesirable in the case of observational satisfaction, but beneficial in the case of dynamic equations in a states-as-algebras framework. The suitability of our approach for security formalisms, which also exhibit the phenomenon that security assertions tend to be unstable under refinement [8], is under investigation.…”

Section: Resultsmentioning

confidence: 99%

Type Class Polymorphism in an Institutional Framework

Schröder

Mossakowski

Lüth

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped with a 'naive' semantics defined in terms of collections of instances. However, this semantics has the unpleasant property that while model reduction preserves satisfaction of sentences, model expansion generally does not. In other words, unless further measures are taken, type class polymorphism fails to constitute a proper institution, being only a so-called rps preinstitution; this is unfortunate, as it means that one cannot use institution-independent or heterogeneous structuring languages, proof calculi, and tools with it.Here, we suggest to remedy this problem by modifying the notion of model to include information also about its potential future extensions. Our construction works at a high level of generality in the sense that it provides, for any preinstitution, an institution in which the original preinstitution can be represented. The semantics of polymorphism used in the specification language HasCasl makes use of this result. In fact, HasCasl's polymorphism is a special case of a general notion of polymorphism in institutions introduced here, and our construction leads to the right notion of semantic consequence when applied to this generic polymorphism. The appropriateness of the construction for other frameworks that share the same problem depends on methodological questions to be decided case by case. In particular, it turns out that our method is apparently unsuitable for observational logics, while it works well with abstract state machine formalisms such as state-based Casl.

show abstract

Section: Resultsmentioning

confidence: 99%

Type Class Polymorphism in an Institutional Framework

Schröder

Mossakowski

Lüth

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We recall here the following: Strong NDC (SNDC) introduced in [3], Strong BNDC (SBNDC) introduced in [5], and Compositional P BNDC (CP BNDC) introduced in [3]. SNDC implies NDC, while the other properties imply BNDC.…”

Section: Definition 24 (Ndc and Bndc)mentioning

confidence: 99%

“…All the persistent properties mentioned above can be defined as instances of a generalized unwinding condition introduced in [3]. The idea behind the notion of unwinding is to specify some constraints on the transitions of the system which imply some global properties.…”

Section: Definition 24 (Ndc and Bndc)mentioning

confidence: 99%

“…In particular, when an unwinding condition is used to define a noninterference property it usually requires that each high level action can be "simulated" in such a way that it is impossible for the low level user to infer which high level actions have been performed [18]. The generalized unwinding condition introduced in [3] is parametric with respect to two binary relations on processes: a low level equivalence relation, Ú Ð , which represents the low level view, and a transition relation, Ã , which characterizes a local connectivity.…”

Section: Definition 24 (Ndc and Bndc)mentioning

confidence: 99%

See 1 more Smart Citation

Modelling downgrading in information flow security

Bossi¹,

Piazza²,

Rossi³

Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004.

Self Cite

View full text Add to dashboard Cite

show abstract

“…To avoid them we could exploit an idea of generalized unwinding introduced by Bossi, Focardi, Piazza and Rossi (see [BFPR03,BMPR05]) and in this way we can obtain decidability results for active NIF for finite state systems.…”

Section: Active Attacksmentioning

confidence: 99%

Information-Flow Attacks Based on Limited Observations

Gruska

Perspectives of Systems Informatics

View full text Add to dashboard Cite

Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and on a concept of observations which make visible only a part of a system behaviour. An intruder tries to deduce some private system activities from this partial information which contains also timing of actions. To obtain realistic security characterizations some limitations on observational power of the intruder are applied. It is assumed that the intruder has only limited time window to perform the attack or time of action occurrences can be measured only with a given limited precision.

show abstract

Refinement operators and information flow security

Cited by 24 publications

References 21 publications

Type Class Polymorphism in an Institutional Framework

Type Class Polymorphism in an Institutional Framework

Modelling downgrading in information flow security

Information-Flow Attacks Based on Limited Observations

Contact Info

Product

Resources

About