Simulation Opacity

• Autorzy: Gruska D. P.

Identyfikatory

DOI

10.3233/FI-2014-1069

• Języki publikacji: EN

Abstrakty

EN

Opacity testing is formalized and studied. We specify opacity testers as well as tested systems by (timed) process algebras. We model various testers according to how sophisticated observations of tested system they can make and which kind of conclusions they can obtain. We use this technique to define several realistic security properties. The properties are studied and compared with other security concepts.

Słowa kluczowe

EN

opacity; process algebras; information flow; security

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2014
• Tom: Vol. 133, nr 2/3
• Strony: 165--179
• Opis fizyczny: Bibliogr. 19 poz., rys.

Twórcy

autor

Gruska D. P.

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

Bibliografia

• [1] Bryans J., 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.
• [2] 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.
• [3] Busi N. and R. Gorrieri: Positive Non-interference in Elementary and Trace Nets. Proc. of Application and Theory of Petri Nets 2004, LNCS 3099, Springer, Berlin, 2004.
• [4] Cleaveland R, J. Parrow and B. Steffen: A semantics-based verification tool for finite-state systems. Proc of Protocol specification, testong and verification, Elsevier Science Publishers, 1990.
• [5] Dhem J.-F., F. Koeune, P.-A. Leroux, P. Mestre, J.-J. Quisquater and J.-L. Willems: A practical implementation of the timing attack. Proc. of the Third Working Conference on Smart Card Research and Advanced Applications (CARDIS 1998), LNCS 1820, Springer, Berlin, 1998.
• [6] Focardi R., R. Gorrieri, and F.Martinelli: Information flow analysis in a discrete-time process algebra. Proc. 13th Computer Security FoundationWorkshop, IEEE Computer Society Press, 2000.
• [7] Gorrieri R. and F. Martinelli: A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Science of Computer Programing, Volume 50, Issues 13, 2004.
• [8] Goguen J.A. and J.Meseguer: Security Policies and SecurityModels. Proc. of IEEE Symposiumon Security and Privacy, 1982.
• [9] Groote J.F.: “Transition Systems Specification with Negative Premises”. Baeten, J.C.M. and Klop, J.W. (eds.), CONCUR’90, Springer Verlag, Berlin, LNCS 458, 1990.
• [10] Gruska D.P.: Informational analysis of security and integrity. Fundamenta Informaticae, vol. 120, Numbers 3-4, 2012.
• [11] Gruska D.P.: Test based security. Concurrency, Specification and Verification CS&P 2012, Vol. 1, Berlin, 2012.
• [12] Gruska D.P.: Gained and Excluded Private Actions by Process Observations. Fundamenta Informaticae, Vol. 109, Number 3, 2011.
• [13] Gruska D.P.: Process algebra contexts and security properties. Fundamenta Informaticae, vol. 102, Number 1, 2010.
• [14] Gruska D.P.: Quantifying Security for Timed Process Algebras. Fundamenta Informaticae, vol. 93, Numbers 1-3, 2009.
• [15] Gruska D.P.: Probabilistic Information Flow Security. Fundamenta Informaticae, vol. 85, Numbers 1-4, 2008.
• [16] Gruska D.P.: Observation Based System Security. Fundamenta Informaticae, vol. 79, Numbers 3-4, 2007.
• [17] Kanellakis P.C. and S.A. Smolka: CCS expressions, finite state processes, and three problems of equivalence. Proc. of the second annual ACM symposium on Principles of distributed computing, ACM, 1983.
• [18] Kocher P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems. Proc. Advances in Cryptology - CRYPTO’96, LNCS 1109, Springer, Berlin, 1996.
• [19] Milner R.: Communication and concurrency. Prentice-Hall International, New York, 1989