Quantifying Security for Timed Process Algebras

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. gruska@fmph.uniba.sk

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

Abstract: A quantification of process's security by quantification of an amount of information flow is defined and studied in the framework of timed process algebras. The resulting quantified security is compared with other (qualitative) security notions. Unprecise and limited observations are defined and discussed.

Keywords: information flow, information theory, opacity, surprisal, uncertainty, security, unprecise and limited observations

DOI: 10.3233/FI-2009-0094

Journal: Fundamenta Informaticae, vol. 93, no. 1-3, pp. 155-169, 2009