Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems - Formal Techniques for Distributed Objects, Components, and Systems
Conference Papers Year : 2023

Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems

Abstract

The theory of noninterference supports the analysis 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 move to a sufficiently expressive semantics that, in an interleaving framework, 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 classical hierarchy based on weak bisimilarity.
Embargoed file
Embargoed file
1 2 4
Year Month Jours
Avant la publication
Thursday, January 1, 2026
Embargoed file
Thursday, January 1, 2026
Please log in to request access to the document

Dates and versions

hal-04731937 , version 1 (11-10-2024)

Licence

Identifiers

Cite

Andrea Esposito, Alessandro Aldini, Marco Bernardo. Branching Bisimulation Semantics Enables Noninterference Analysis of Reversible Systems. 43th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2023, Lisbon, Portugal. pp.57-74, ⟨10.1007/978-3-031-35355-0_5⟩. ⟨hal-04731937⟩
0 View
0 Download

Altmetric

Share

More