Abstract
Safety and secrecy are formulated for a deterministic programming language. A safety property is defined as a set of program traces and secrecy is defined as a binary relation on traces, characterizing a form of Noninterference. Safety properties may have sound and complete execution monitors whereas secrecy has no such monitor.
This material is based upon activities supported by the National Science Foundation under Agreement No. CCR-9612345 [sic].
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
MartÃn Abadi. Secrecy in programming-language semantics. In Proc. 15th Mathematical Foundations of Program Semantics, pages 1–14, April 1999.
R. Focardi and R. Gorrieri. A classification of security properties for process algebras. Journal of Computer Security, 3(1):5–33, 1994/1995.
Nevin Heintze and Jon Riecke. The SLam Calculus: Programming with secrecy and integrity. In Proceedings 25th Symposium on Principles of Programming Languages, pages 365–377, San Diego, CA, January 1998.
K.R.M. Leino and R. Joshi. A semantic approach to secure information flow. In Proc 4th Int’l Conference on Mathematics of Program Construction, pages 254–271. Lecture Notes in Computer Science 1422, 1998.
John McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proceedings 1994 IEEE Symposium on Security and Privacy, pages 79–93, Oakland, CA, May 1994.
A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. In Proc. 8th European Symposium on Programming. Lecture Notes in Computer Science 1576, March 1999.
F.B. Schneider. Enforceable security policies. Technical Report TR98-1664, Cornell University, January 1998.
Geoffrey Smith and Dennis Volpano. Secure information flow in a multi-threaded imperative language. In Proceedings 25th Symposium on Principles of Programming Languages, pages 355–364, San Diego, CA, January 1998.
Dennis Volpano and Geoffrey Smith. Eliminating covert flows with minimum typings. In Proceedings 10th IEEE Computer Security Foundations Workshop, pages 156–168, June 1997.
Dennis Volpano, Geoffrey Smith, and Cynthia Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(2,3):167–187, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Volpano, D. (1999). Safety versus Secrecy. In: Cortesi, A., Filé, G. (eds) Static Analysis. SAS 1999. Lecture Notes in Computer Science, vol 1694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48294-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-48294-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66459-8
Online ISBN: 978-3-540-48294-9
eBook Packages: Springer Book Archive