Quantification of Positive and Negative Attacker's Information

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Gruska, Damas P.

Affiliations: Institute of Informatics, Comenius University, Mlynska dolina, 842 48 Bratislava, Slovakia, [email protected]

Note: [] Address for correspondence: Institute of Informatics, Comenius University, Mlynska dolina, 842 48 Bratislava, Slovakia

Abstract: Different techniques for expressing an amount of information on secrete data which can be obtained by a process observation are presented. They are based on information theory and they express certainty about sets of private actions which execution is guaranteed by a given observation and sets of actions which execution is excluded by a given observation. Moreover, the case when an intruder has same preliminary belief on secrete data is discussed. It is shown how the presented technique could be applied for such case. As regards working formalism, probabilistic process algebra is used for description of systems as well as attacker's belief.

Keywords: probabilistic process algebras, information flow, opacity, security, belief

DOI: 10.3233/FI-2012-764

Journal: Fundamenta Informaticae, vol. 120, no. 3-4, pp. 311-324, 2012