Abstract
Non-interference is a security property which states that improper information leakages due to direct and indirect flows have not occurred through executing programs. In this paper we investigate a game semantics based formulation of non-interference that allows to perform a security analysis of closed and open procedural programs. We show that such formulation is amenable to automated verification techniques. The practicality of this method is illustrated by several examples, which also emphasize its advantage compared to known operational methods for reasoning about open programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., McCusker, G.: Game Semantics. In: Proceedings of the 1997 Marktoberdorf Summer School: Computational Logic, pp. 1–56. Springer (1998)
Barthe, G., D’Argenio, P.R., Rezk, T.: Secure information flow by self-composition. In: IEEE CSFW 2004, pp. 100–114. IEEE Computer Society Press (2004)
Clark, D., Hankin, C., Hunt, S.: Information flow for Alogol-like languages. Computer Languages 28(1), 3–28 (2002)
Denning, D.E.: Cryptography and Data Security. Addison-Wesley, Reading (1982)
Dimovski, A., Ghica, D.R., Lazić, R.S.: Data-Abstraction Refinement: A Game Semantic Approach. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 102–117. Springer, Heidelberg (2005)
Dimovski, A., Lazić, R.: Compositional Software Verification Based on Game Semantics and Process Algebras. Int. Journal on STTT 9(1), 37–51 (2007)
Dimovski, A.: Slot Games for Detecting Timing Leaks of Programs. In: Puppis, G., Villa, T. (eds.) GandALF 2013. EPTCS, vol. 119, pp. 166–179. Open Publishing Association (2013)
Dimovski, A.: Program Verification Using Symbolic Game Semantics. In: Theoretical Computer Science (TCS) (January 2014)
Ghica, D.R., McCusker, G.: The Regular-Language Semantics of Second-order Idealized Algol. Theoretical Computer Science 309(1-3), 469–502 (2003)
Ghica, D.R.: Slot Games: a quantitative model of computation. In: Palsberg, J., Abadi, M. (eds.) POPL 2005, pp. 85–97. ACM Press, New York (1998)
Heintze, N., Riecke, J.G.: The SLam calculus: programming with secrecy and integrity. In: MacQueen, D.B., Cardelli, L. (eds.) POPL 1998, pp. 365–377. ACM, New York (1998)
Joshi, R., Leino, K.R.M.: A semantic approach to secure information flow. Science of Computer Programming 37, 113–138 (2000)
Malacaria, M., Hankin, C.: Non-deterministic games and program analysis: An application to security. In: LICS 1999, pp. 443–452. IEEE Computer Society Press, Los Alamitos (1999)
McLean, J.: Proving noninterference and functional correctness using traces. J. Computer Security 1(1), 37–58 (1992)
Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE Journal on Selected Areas in Communications 21(1), 5–19 (2003)
Volpano, D., Smith, G., Irvine, C.: A sound type system for secure flow analysis. Journal of Computer Security 4(2/3), 167–188 (1996)
Volpano, D., Smith, G.: Eliminating covert flows with minimum typings. In: IEEE Computer Security Foundations Workshop (CSFW), pp. 156–169. IEEE Computer Society Press (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Dimovski, A.S. (2014). Ensuring Secure Non-interference of Programs by Game Semantics. In: Mauw, S., Jensen, C.D. (eds) Security and Trust Management. STM 2014. Lecture Notes in Computer Science, vol 8743. Springer, Cham. https://doi.org/10.1007/978-3-319-11851-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-11851-2_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11850-5
Online ISBN: 978-3-319-11851-2
eBook Packages: Computer ScienceComputer Science (R0)