Salvato in:
Dettagli Bibliografici
Autori principali: Esposito, Andrea, Aldini, Alessandro, Bernardo, Marco, Rossi, Sabina
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:https://arxiv.org/abs/2311.15670
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913667253010432
author Esposito, Andrea
Aldini, Alessandro
Bernardo, Marco
Rossi, Sabina
author_facet Esposito, Andrea
Aldini, Alessandro
Bernardo, Marco
Rossi, Sabina
contents The theory of noninterference supports the analysis of information leakage and the execution of secure computations in multi-level security systems. Classical equivalence-based approaches to noninterference mainly rely on weak bisimulation semantics. We show that this approach is not sufficient to identify potential covert channels in the presence of reversible computations. As illustrated via a database management system example, the activation of backward computations may trigger information flows that are not observable when proceeding in the standard forward direction. To capture the effects of back-and-forth computations, it is necessary to switch to a more expressive semantics, which has been proven to be branching bisimilarity in a previous work by De Nicola, Montanari, and Vaandrager. In this paper we investigate a taxonomy of noninterference properties based on branching bisimilarity along with their preservation and compositionality features, then we compare it with the taxonomy of Focardi and Gorrieri based on weak bisimilarity.
format Preprint
id arxiv_https___arxiv_org_abs_2311_15670
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Noninterference Analysis of Reversible Systems: An Approach Based on Branching Bisimilarity
Esposito, Andrea
Aldini, Alessandro
Bernardo, Marco
Rossi, Sabina
Cryptography and Security
The theory of noninterference supports the analysis of information leakage and the execution of secure computations in multi-level security systems. Classical equivalence-based approaches to noninterference mainly rely on weak bisimulation semantics. We show that this approach is not sufficient to identify potential covert channels in the presence of reversible computations. As illustrated via a database management system example, the activation of backward computations may trigger information flows that are not observable when proceeding in the standard forward direction. To capture the effects of back-and-forth computations, it is necessary to switch to a more expressive semantics, which has been proven to be branching bisimilarity in a previous work by De Nicola, Montanari, and Vaandrager. In this paper we investigate a taxonomy of noninterference properties based on branching bisimilarity along with their preservation and compositionality features, then we compare it with the taxonomy of Focardi and Gorrieri based on weak bisimilarity.
title Noninterference Analysis of Reversible Systems: An Approach Based on Branching Bisimilarity
topic Cryptography and Security
url https://arxiv.org/abs/2311.15670