Abstract
We propose a type system to ensure the property of noninterference in a system of concurrent programs, described in a standard imperative language extended with parallelism. Our proposal is in the line of some recent work by Irvine, Volpano and Smith. Our type system, as well as our semantics for concurrent programs, seem more natural and less restrictive than those originally presented by these authors. Moreover, we show how to adapt the type system in order to preserve the noninterference results in the presence of scheduling policies, while remaining in a nonprobabilistic setting.
Research partially funded by the EU Working Group CONFER II and by the french RNRT Project MARVEL.
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
M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749–786, 1999.
GĂ©rard Boudol and Ilaria Castellani. Noninterference for concurrent programs. Research report, INRIA, 2001.
R. Focardi, R. Gorrieri, and F. Martinelli. Non interference for the analysis of cryptographic protocols. In Proceedings ICALP’00, number 1853 in LNCS, 2000.
J. A. Goguen and J. Meseguer. Security policies and security models. In Proceedings 1982 IEEE Symposium on Security and Privacy, pages 11–20, 1982.
M. Hennessy. The security π-calculus and noninterference. Computer Science Technical Report 2000:05, University of Sussex, 2000.
M. Hennessy and J. Riely. Information flow vs resource access in the asynchronous pi-calculus (extended abstract). In Proceedings ICALP’00, number 1853 in LNCS, 2000.
K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as typed process behaviour. In Proceedings ESOP’00, number 1782 in LNCS, 2000.
J. Millen. 20 years of covert channel modeling and analysis. In IEEE Symposium on Security and Privacy, 1999.
A. Myers. Jflow: Practical mostly-static information flow control. In 26th ACM Symposium on Principles of Programming Languages (POPL), 1999.
F. Pottier and S. Conchon. Information flow inference for free. In Proceedings ICFP’00, 2000.
A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In IEEE Computer Security Foundations Workshop, 2000.
G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In ACM, editor, Proceedings POPL’ 98, pages 355–364. ACM Press, 1998.
D. Volpano and G. Smith. A type-based approach to program security. In TAP-SOFT’97, number 1214 in LNCS, pages 607–621, 1997.
D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. Journal of Computer Security, 7(2-3), 1999.
D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167–187, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boudol, G., Castellani, I. (2001). Noninterference for Concurrent Programs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_32
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive