Informational Analysis of Security and Integrity

• Autorzy: Gruska D.P.
• Języki publikacji: EN

Abstrakty

EN

Formalisms for analysis of systems of various nature specified by process algebras are proposed. They allow us to formalize security properties based on an absence of information flow and properties on system’s integrity. Resulting properties are compared and discussed. We present also quantification of these properties by means of information theory.

Słowa kluczowe

EN

information flow; opacity; nested attackers; information theory

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2012
• Tom: Vol. 120, nr 3/4
• Strony: 295--309
• Opis fizyczny: Bibliogr. 22 poz.

Twórcy

autor

Gruska D.P.

• Institute of Informatics, Comenius University Mlynska dolina, 842 48 Bratislava, Slovakia,

Bibliografia

• [1] Barbuti R., D.P. Gruska, A. Maggiolo-Schettini and P. Milazzo: A notion of biological diagnosability inspired by the notion of opacity in systems security. Fundamenta Informaticae, Vol. 102, No. 1 (2010), s. 19-34, 2010.
• [2] Bossi A., R. Focardi, C. Piazza and S. Rossi. Refinement Operators and Information Flow Security. Proc. of SEFM'03, IEEE Computer Society Press, 2003.
• [3] Bryans J., M. Koutny, L. Mazare and P. Ryan: Opacity Generalised to Transition Systems. In Proceedings of the Formal Aspects in Security and Trust, LNCS 3866, Springer, Berlin, 2006.
• [4] Clark D., S. Hunt and P. Malacaria: A Static Analysis for Quantifying the Information Flow in a Simple Imperative Programming Language. The Journal of Computer Security, 15(3). 2007.
• [5] Focardi, R., R. Gorrieri, and F. Martinelli: Information flow analysis in a discrete-time process algebra. Proc. 13th Computer Security Foundation Workshop, IEEE Computer Society Press, 2000.
• [6] Focardi, R. and S. Rossi: Information flow security in Dynamic Contexts. Proc. of the IEEE Computer Security Foundations Workshop, 307-319, IEEE Computer Society Press, 2002.
• [7] Focardi, R., R. Gorrieri, and F. Martinelli: Real-Time information flow analysis. IEEE Journal on Selected Areas in Communications 21 (2003).
• [8] Glabbeek R. J. van, S. A. Smolka and B. Steffen: Reactive, Generative and Stratified Models of Probabilistic Processes Inf. Comput. 121(1): 59-80, 1995.
• [9] Gorrieri R. and F. Martinelli: A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Science of Computer Programming archive Volume 50, Issue 1-3, 2004.
• [10] Gorrieri R., F. Martinelli and I. Matteucci: Specification and Analysis of Information Flow Properties for Distributed Systems. Submitted for publications, 2010.
• [11] Diagnosability of nested intruders, Proc. of Bionetics 2010, Springer Verlag, 2010.
• [12] Gruska D.P.: Quantifying Security for Timed Process Algebras Fundamenta Informaticae, Vol. 93, No. 1-3, 2009.
• [13] Gruska D.P.: Probabilistic information flow security. Fundamenta Informaticae, Vol. 85, No. 1-4, 2008.
• [14] Gruska D.P.: Observation Based System Security. Fundamenta Informaticae, vol 79, Numbers 3-4, 2007.
• [15] Gruska D.P.: Information-Flow Security for Restricted Attackers. in Proc. of 8th International Symposium on Systems and Information Security, Sao Jose dos Campos, 2006.
• [16] Gruska D.P.: Information Flow in Timing Attacks. Proceedings CS&P'04, 2004.
• [17] Gruska D.P. and A. Maggiolo-Schettini: Nested Timing Attacks, in proceedings of FAST'03, Pisa, pp 147-161, 2003.
• [18] Goguen J.A. and J. Meseguer: Security policies and security models. Proc. of IEEE Symposium on Security and Privacy, 1982.
• [19] Lowe G.: Quantifying information flow". In Proc. IEEE Computer Security Foundations Workshop, 2002.
• [20] Milner, R.: Communication and concurrency. Prentice-Hall International, New York, 1989.
• [21] Segala R. and N. Lynch: Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2): 250-273, 1995.
• [22] Shannon, C. E.: A mathematical theory of communication. Bell System Technical Journal, vol. 27, 1948.