# Persistent Stochastic Non-Interference

@article{Hillston2018PersistentSN, title={Persistent Stochastic Non-Interference}, author={Jane Hillston and Carla Piazza and Sabina Rossi}, journal={Fundam. Informaticae}, year={2018}, volume={181}, pages={1-35} }

In this paper, we study an information flow security property for systems specified as terms of a quantitative Markovian process algebra, namely the Performance Evaluation Process Algebra (PEPA). We propose a quantitative extension of the Non-Interference property used to secure systems from the functional point view by assuming that the observers are able to measure also the timing properties of the system, e.g., the response time of certain actions or its throughput. We introduce the notion…

## 2 Citations

### A Process Algebra for (Delimited) Persistent Stochastic Non-Interference

- Computer ScienceCILC
- 2019

It is shown that a PEPA process P that satisfies (D)_PSNI admits only controlled information flows from the high, private, level of confidentiality to the low, public, one.

### A noninterference trusted dual system security guarantee method based on secure memory

- Computer ScienceConcurrency and Computation: Practice and Experience
- 2022

## References

SHOWING 1-10 OF 32 REFERENCES

### Non-interference proof techniques for the analysis of cryptographic protocols

- Computer Science, MathematicsJ. Comput. Secur.
- 2005

New characterizations of non-interference that rely on a finitary representation of intruders are developed, drawing on equivalence relations built on top of labelled transition systems in which the presence of intruder is accounted for, indirectly, in terms of their (the intruders') knowledge of the protocols' initial data.

### Process algebra and non-interference

- Computer ScienceProceedings of the 12th IEEE Computer Security Foundations Workshop
- 1999

It is illustrated how several of the leading candidates for a definition of non-interference mirror notions of system equivalence, which is a deep and controversial question in computer science with a number of distinct definitions proposed in the literature.

### Verifying persistent security properties

- Computer Science, MathematicsComput. Lang. Syst. Struct.
- 2004

### A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference

- Computer ScienceARSPA-WITS
- 2009

It is obtained that stochastic noninterference turns out to be very strict and limiting in real-world applications and, therefore, requires the use of relaxation techniques.

### Information flow vs. resource access in the asynchronous pi-calculus

- Computer ScienceTOPL
- 2002

An extension of the asynchronous π-calculus in which a variety of security properties may be captured using types is proposed, which is a uniform typing system that, by varying slightly the allowed set of types, captures different notions of security.

### Approximate non-interference

- Computer ScienceProceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15
- 2002

A model in which the notion of non-interference is approximated in the sense that it allows for some exactly quantified leakage of information, characterised via a notion of process similarity which replaces the indistinguishability of processes by a quantitative measure of their behavioural difference.

### Real-time information flow analysis

- Computer ScienceIEEE J. Sel. Areas Commun.
- 2003

This paper reformulated some noninterference properties for information flow analysis in computer systems on classic (possibilistic) labeled transition systems, notably bisimulation-based nondeducibility on compositions (BNDC), by enhancing the security process algebra proposed by two of the authors with some extra constructs to model real-time systems.

### P-congruences as non-interference for the pi-calculus

- Computer Science, MathematicsFMSE '06
- 2006

It is shown that the noninterference property is compositional with respect to most of the operators of the language leading to efficient proof techniques for the verification and the construction of (compositional) secure systems.

### Contextual lumpability

- Computer Science, MathematicsVALUETOOLS
- 2013

This paper proposes a slightly relaxed definition of Markovian bisimulation, named lumpable bisimilarity, and proves that this is a characterisation of the notion of contextual lumpability for PEPA components, and provides an algorithm that induces the largest contextual lumping over the Markov process underlying any PEPA component.