Process Algebra Contexts and Security Properties

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

Abstrakty

EN

A general framework for defining security properties is presented. It allows us to model many traditional security properties as well as to define new ones. The framework is based on process algebras contexts and processes relations. By appropriate choice of both of them we can model also probabilistic and quantified security properties.

Słowa kluczowe

EN

information flow; opacity; surprisal; uncertainty; security; quantified information flow

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2010
• Tom: Vol. 102, nr 1
• Strony: 63--76
• Opis fizyczny: Bibliogr. 20 poz.

Twórcy

autor

Gruska D.P.

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

Bibliografia

• [1] A. Aldini: Probabilistic Information Flow in a Process Algebra. CONCUR'01, Springer LNCS 2154, 2001.
• [2] R. Alur, P. Černy´ and S. Zdancewic: Preserving Secrecy under Refinement. In Proc. of 33rd International Colloquium on Automata, Languages and Programming (ICALP), 2006.
• [3] J. Bryans, M. Koutny, L. Mazare and P. Ryan: Opacity generalised to transition systems. International Journal of Information Security, Vol. 7, No. 6, 2008.
• [4] J. Bryans, M. Koutny and P. Ryan: Modelling non-deducibility using Petri Nets. Proc. of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models, 2004.
• [5] D. Clark, 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.
• [6] M.R. Clarkson, A.C. Myers, F.B. Schneider: Quantifying Information Flow with Beliefs. Journal of Computer Security, to appear, 2009.
• [7] R. Focardi, 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.
• [8] R. Focardi, R. Gorrieri, and F. Martinelli: Real-Time information flow analysis. IEEE Journal on Selected Areas in Communications 21 (2003).
• [9] R. J. van Glabbeek, S. A. Smolka and B. Steffen: Reactive, Generative and Stratified Models of Probabilistic Processes Inf. Comput. 121(1): 59-80, 1995.
• [10] R. Gorrieri 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.
• [11] D.P. Gruska: Quantifying Security for Timed Process Algebras, Fundamenta Informaticae, vol. 93, Numbers 1-3, 2009.
• [12] D.P. Gruska: Probabilistic Information Flow Security. Fundamenta Informaticae, vol. 85, Numbers 1-4, 2008.
• [13] D.P. Gruska: Observation Based System Security, Fundamenta Informaticae, 79 (2007), Numbers 3-4, pp. 335-346, 2007.
• [14] D.P. Gruska: Network Information Flow, Fundamenta Informaticae, Volume 72, Numbers 1-3, pp 167-180, 2006.
• [15] D.P. Gruska: Information Flow in Timing Attacks. Proceedings CS&P'04, 2004.
• [16] H. Hansson and B. Jonsson: A Calculus for Communicating Systems with Time and Probabilities. In Proceedings of 11th IEEE Real - Time Systems Symposium, Orlando, 1990.
• [17] N. Löpez and Nünez: An Overview of Probabilistic Process Algebras and their Equivalences. In Validation of Stochastic Systems, LNCS 2925, Springer-Verlag, Berlin, 2004.
• [18] R. Segala and N. Lynch: Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2): 250-273, 1995.
• [19] C. E. Shannon: A mathematical theory of communication. Bell System Technical Journal, vol. 27, 1948.
• [20] A. Zakinthinos and E. S. Lee: A general theory of security properties. In Proc. of SP'97, 1997.