Refinement operators and information flow security
Annalisa Bossi,Riccardo Focardi,Carla Piazza,Sabina Rossi +3 more
- 14 Oct 2003
- pp 44-53
TL;DR: This paper formalizes the notion of refinement for processes described as terms of the security process algebra (SPA) and considers several information flow security properties and provides sufficient conditions under which the authors' refinement operators preserve such security properties.
read more
Abstract: The systematic development of complex systems usually relies on a stepwise refinement procedure from an abstract specification to a more concrete one that can finally be implemented. The use of refinement operators preserving system properties is clearly essential since it avoids properties to be re-investigated at each development step. In this paper, we formalize the notion of refinement for processes described as terms of the security process algebra (SPA). We consider several information flow security properties and provide sufficient conditions under which our refinement operators preserve such security properties. Finally, we study how refinements can be composed still preserving the security of the system.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Citations
Modelling downgrading in information flow security
Annalisa Bossi,Carla Piazza,Sabina Rossi +2 more
- 28 Jun 2004
TL;DR: This paper proposes a general unwinding framework for formalizing different noninterference properties permitting downgrading, i.e., allowing information to flow from a higher to a lower security level through a downgrader.
Verifying persistent security properties
TL;DR: This work studies bisimulation-based information flow security properties which are persistent, in the sense that if a system is secure then all of its reachable states are secure too, and provides a characterization of such properties in terms of unwinding conditions which demand properties of individual actions.
Type class polymorphism in an institutional framework
Lutz Schröder,Till Mossakowski,Christoph Lüth +2 more
- 27 Mar 2004
TL;DR: The construction of HasCasl's polymorphism is a special case of a general notion of polymorphism in institutions introduced here, and its construction leads to the right notion of semantic consequence when applied to this generic polymorphism.
•Journal Article
Observation Based System Security
TL;DR: A formal model for description of passive and active timing attacks is presented, studied and compared with other security concepts.
25
Unwinding in Information Flow Security
TL;DR: The unwinding condition is exploited to dictate the form of the rules the authors can use to incrementally develop secure processes and to rectify insecure processes.
20
References
•Book
Communication and Concurrency
Robin Milner
- 01 Jan 1989
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
9K
Security Policies and Security Models
Joseph A. Goguen,José Meseguer +1 more
- 26 Apr 1982
TL;DR: The reader is familiar with the ubiquity of information in the modern world and is sympathetic with the need for restricting rights to read, add, modify, or delete information in specific contexts.
2.4K
Secure Computer System: Unified Exposition and Multics Interpretation
D. Elliott Bell,Leonard J. La Padula +1 more
- 01 Mar 1976
TL;DR: A suggestive interpretation of the model in the context of Multics and a discussion of several other important topics (such as communications paths, sabotage and integrity) conclude the report.
Computing simulations on finite and infinite graphs
Monika Henzinger,Thomas A. Henzinger,Peter W. Kopke +2 more
- 23 Oct 1995
TL;DR: 2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented infinite graphs with finite similarity relations and it follows that the refinement problem and the /spl forall/CTL* model-checking problem are decidable for 2D rectangular Automata.
A Classification of Security Properties for Process Algebras
TL;DR: This work provides a process algebra similar to CCS with a set of security notions, hence relating these two areas of concurrency research and showing that some of these security properties are composable w.r.t. the operators of parallelism and action restriction.
337
Related Papers (5)
Joseph A. Goguen,José Meseguer +1 more
- 26 Apr 1982
Heiko Mantel
- 14 May 2001
Robin Milner
- 01 Jan 1989
A. W. Roscoe
- 08 May 1995