Describing Secure Interfaces with Interface Automata | Zendy

Matías Lee | Zendy; Pedro R. D’Argenio | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Describing Secure Interfaces with Interface Automata

Author(s) -

Matías Lee,

Pedro R. D’Argenio

Publication year - 2010

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2010.07.008

Subject(s) - computer science , stateful firewall , interface (matter) , automaton , focus (optics) , theoretical computer science , representation (politics) , process (computing) , process calculus , bisimulation , distributed computing , programming language , computer security , operating system , physics , bubble , maximum bubble pressure method , network packet , politics , law , political science , optics

Interface automata are a model that allows for the representation of stateful interfaces. In this paper we introduce a variant of interface automata, which we call interface structure for security (ISS), that allows for the modelling of security. We focus on the property of non interference, more precisely in bisimulation-based non interference for reactive systems. We define the notion of compatible interfaces in this setting meaning that they can be composed so that a secure interface can be synthesized from the composition. In fact, we provide an algorithm that determines whether an ISS can be made secure by controlling (more specifically, pruning) some public input actions, and if so, synthesize the secure ISS. In addition, we also provide some sufficient conditions on the components ISS to ensure that their composition is secure (and hence no synthesis process is needed)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research