Non-interference Notions Based on Reveals and Excludes Relations for Petri Nets

Bernardinello, Luca; Kılınç, Görkem; Pomello, Lucia

doi:10.1007/978-3-662-53401-4_3

Cited by 6 publications

(9 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [36] reveals, extended-reveals and excludes relations were introduced for the transitions of a Petri net with the aim of modelling information flow in concurrent systems. A number of noninterference notions were defined by means of reveals and excludes relations providing different levels of security guarantees.…”

Section: Information Flow Between Transitions Of a Petri Netmentioning

confidence: 99%

“…In [34], the authors provide an algorithm to compute all the minimal solutions for enforcing noninterference on bounded Petri nets by using linear integer programming techniques. In this work, we follow the line of results from the references [35] and [36] which introduce two families of relations, namely reveals and excludes, to model information flow among transitions of a Petri net and use these relations to define various noninterference properties for 1-safe Petri nets. The original reveals relation was defined for events of an occurrence net by Haar in [37].…”

Section: Introduction and Related Workmentioning

confidence: 99%

“…In [38] it was applied in the field of fault diagnosis. Later, in [36], the relation was redefined for transitions of a Petri net and applied in the field of information-flow security by means of noninterference.…”

Section: Introduction and Related Workmentioning

confidence: 99%

“…We show that there exists a finite prefix of such tree, named full prefix, on which reveals and excludes relations between the transitions of the corresponding Petri net can be computed efficiently. Thus, the full prefix can be used to determine information flow and to verify noninterference on the basis of reveals and excludes relations as defined in [35], [36]. We prove that the full prefix is sufficient to directly determine reveals relations, and we provide an algorithm to compute excludes relations on it.…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 3 more Smart Citations

A Finite Prefix for Analyzing Information Flow Among Transitions of a Free-Choice Net

2022

View full text Add to dashboard Cite

In distributed systems, the occurrence of an action can give information about the occurrence of other actions. This can be an unwanted situation when "high" actions of the system need to be kept secret, while allowing users to observe "low" actions. If it is possible to deduce information about occurrence of high actions by observing only low actions, then the system suffers from an unwanted information flow. "Reveals" and "excludes" relations were introduced for modelling and analysing such an information flow among actions of a distributed system that is modelled via Petri nets. In this paper, we provide a formal basis for computing reveals and excludes relations of 1-safe free-choice Petri nets. We introduce the "maximalstep computation tree" to represent the behaviour of a distributed system under maximal-step semantics. We define a finite prefix of the tree called "full prefix" and we show that it is adequate for analysing information flow by means of reveals and excludes relations.

show abstract

Section: Information Flow Between Transitions Of a Petri Netmentioning

confidence: 99%

Section: Introduction and Related Workmentioning

confidence: 99%

Section: Introduction and Related Workmentioning

confidence: 99%

Section: Introduction and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A Finite Prefix for Analyzing Information Flow Among Transitions of a Free-Choice Net

2022

View full text Add to dashboard Cite

show abstract

“…Apart from the aforementioned work that deals with the interleaving semantics of concurrency, treatment of true concurrency exists. For instance, in [6] and [5], expressive security policies and properties are studied for Petri nets and event structures, respectively.…”

Section: Information-flow Security For Concurrent Systemsmentioning

confidence: 99%

Enforcing globally dependent flow policies in message-passing systems

Nielson

2019

Journal of Computer Languages

View full text Add to dashboard Cite

 Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commercial gain  You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

show abstract