Design and verification of trusted collective adaptive systems

A Aldini - ACM Transactions on Modeling and Computer …, 2018 - dl.acm.org
Collective adaptive systems (CAS) often adopt cooperative operating strategies to run
distributed decision-making mechanisms. Sometimes, their effectiveness massively relies on …

[HTML][HTML] Probabilistic divide & congruence: Branching bisimilarity

V Castiglioni, S Tini - Theoretical Computer Science, 2020 - Elsevier
Since the seminal paper by Bloom, Fokkink and van Glabbeek, the Divide and Congruence
technique allows for the derivation of compositional properties of nondeterministic …

Measuring the confinement of probabilistic systems

A Di Pierro, C Hankin, H Wiklicky - Theoretical Computer Science, 2005 - Elsevier
In this paper we lay the semantic basis for a quantitative security analysis of probabilistic
systems by introducing notions of approximate confinement based on various process …

Hidden-Markov program algebra with iteration

A McIver, L Meinicke, C Morgan - Mathematical Structures in …, 2015 - cambridge.org
We use hidden Markov models to motivate a quantitative compositional semantics for
noninterference-based security with iteration, including a refinement-or 'implements' relation …

Estimating the maximum information leakage

A Aldini, A Di Pierro - International Journal of Information Security, 2008 - Springer
Preventing improper information leaks is a greatest challenge of the modern society. In this
paper, we present a technique for measuring the ability of several families of adversaries to …

Source-level reasoning for quantitative information flow

C Chen, A McIver, C Morgan - arXiv preprint arXiv:2405.13416, 2024 - arxiv.org
We present a novel formal system for proving quantitative-leakage properties of programs.
Based on a theory of Quantitative Information Flow (QIF) that models information leakage as …

A Spectrum of Approximate Probabilistic Bisimulations

T Spork, C Baier, JP Katoen, J Piribauer… - arXiv preprint arXiv …, 2024 - arxiv.org
This paper studies various notions of approximate probabilistic bisimulation on labeled
Markov chains (LMCs). We introduce approximate versions of weak and branching …

A layered description of ATM cell traffic streams and correlation analysis

O Gihr, P Tran-Gia - IEEE INFCOM'91-Communications Societies …, 1991 - computer.org
An approach is presented to describe traffic processes in asynchronous transfer mode
(ATM) environments. Using a discrete-time Markov chain to describe the cell process …

Source-Level Reasoning for Quantifying Information Leaks

C Chen, A McIver, C Morgan - … : Essays Dedicated to Joost-Pieter Katoen …, 2024 - Springer
Abstract Information-leak analysis for programs designates certain variables as “high
security”, ie that should not be directly readable by an adversary; the aim then is to show that …

Ask a (n) droid to tell you the odds: probabilistic security-by-contract for mobile devices

A Aldini, A La Marra, F Martinelli, A Saracino - Soft Computing, 2021 - Springer
Security-by-contract is a paradigm proposed for the secure installation, usage, and
monitoring of apps into mobile devices, with the aim of establishing, controlling, and, if …