Abstract
Process opacity for dynamic security policies is formalized and studied. The dynamic security policies influence what an intruder can observe as well as which part of system’s behaviour is classified at a given moment. The resulting security properties are undecidable but under some realistic restrictions we obtain decidable ones.
Work supported by the grant VEGA 1/1333/12.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bryans, J., Koutny, M., Ryan, P.: Modelling non-deducibility using Petri Nets. In: Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models (2004)
Bryans, J.W., Koutny, M., Mazaré, L., Ryan, P.Y.A.: Opacity generalised to transition systems. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2005. LNCS, vol. 3866, pp. 81–95. Springer, Berlin (2006)
van Delft, B., Hunt, S., Sands, D.: Very static enforcement of dynamic policies. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 32–52. Springer, Heidelberg (2015)
Focardi, R., Gorrieri, R., Martinelli, F.: Information flow analysis in a discrete-time process algebra. In: Proceedings of 13\(^{th}\) Computer Security Foundation Workshop. IEEE Computer Society Press (2000)
Gorrieri, R., Martinelli, F.: A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Sci. Comput. Program. 50(1–3), 23–49 (2004)
Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of IEEE Symposium on Security and Privacy (1982)
Groote, J.F.: Transition systems specification with negative premises. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 332–341. Springer, Heidelberg (1990)
Gruska, D.P.: Process opacity for timed process algebra. In: Voronkov, A., Virbitskaite, I. (eds.) PSI 2014. LNCS, vol. 8974, pp. 151–160. Springer, Heidelberg (2015)
Gruska, D.P.: Process algebra contexts and security properties. Fundamenta Informaticae 102(1), 63–76 (2010)
Gruska, D.P.: Observation based system security. Fundamenta Informaticae 79(3–4), 335–346 (2007)
Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. In: Proceedings of The second annual ACM Symposium on Principles of Distributed Computing. ACM (1983)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Gruska, D.P. (2016). Dynamics Security Policies and Process Opacity for Timed Process Algebras. In: Mazzara, M., Voronkov, A. (eds) Perspectives of System Informatics. PSI 2015. Lecture Notes in Computer Science(), vol 9609. Springer, Cham. https://doi.org/10.1007/978-3-319-41579-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-41579-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-41578-9
Online ISBN: 978-3-319-41579-6
eBook Packages: Computer ScienceComputer Science (R0)