A process-algebraic approach for the analysis of probabilistic noninterference1 | Zendy

Alessandro Aldini | Zendy; Mario Bravetti | Zendy; Roberto Gorrieri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A process-algebraic approach for the analysis of probabilistic noninterference1

Author(s) -

Alessandro Aldini,

Mario Bravetti,

Roberto Gorrieri

Publication year - 2004

Publication title -

journal of computer security

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.201

H-Index - 56

eISSN - 1875-8924

pISSN - 0926-227X

DOI - 10.3233/jcs-2004-12202

Subject(s) - nondeterministic algorithm , probabilistic logic , computer science , process calculus , theoretical computer science , information flow , extension (predicate logic) , algebraic number , process (computing) , covert , concurrency , divergence from randomness model , algorithm , programming language , mathematics , artificial intelligence , mathematical analysis , linguistics , philosophy

We define several security properties for the analysis of probabilistic noninterference as a conservative extension of a classical, nondeterministic, process-algebraic approach to information flow theory. We show that probabilistic covert channels (that are not observable in the nondeterministic setting) may be revealed through our approach and that probabilistic information can be exploited to give an estimate of the amount of confidential information flowing to unauthorized users. Finally, we present a case study showing that the expressiveness of the calculus we adopt makes it possible to model and analyze real concurrent systems.

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