Abstract
Confidentiality-preserving refinement describes a relation between a specification and an implementation that ensures that all confidentiality properties required in the specification are preserved by the implementation in a probabilistic setting. The present paper investigates the condition under which that notion of refinement is compositional, i.e. the condition under which refining a subsystem of a larger system yields a confidentiality-preserving refinement of the larger system. It turns out that the refinement relation is not composition in general, but the condition for compositionality can be stated in a way that builds on the analysis of subsystems thus aiding system designers in analyzing a composition.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. A. Goguen and J. Meseguer. Security policies and security models. In IEEE Symposium on Security and Privacy, pages 11–20. IEEE Computer Society Press, 1982.
J. Graham-Cumming and J. W. Sanders. On the refinement of non-interference. In 9th IEEE Computer Security Foundations Workshop, pages 35–42. IEEE Computer Society Press, 1991.
J.W. Gray. Toward a mathematical foundation for information flow security. Journal of Computer Security, 1992.
M. Heisel, A. Pfitzmann, and T. Santen. Confidentiality-preserving refinement. In 14th IEEE Computer Security Foundations Workshop, pages 295–305. IEEE Computer Society Press, 2001.
J. Jacob. On the derivation of secure components. In IEEE Symposium on Security and Privacy, pages 242–247. IEEE Press, 1989.
J. Jürjens. Secure information flow for concurrent processes. In CONCUR 2000, LNCS 1877. Springer-Verlag, 2000.
J. Jürjens. Secrecy-preserving refinement. In J. N. Oliveira and P. Zave, editors, FME 2001: Formal Methods for Increasing Software Productivity, LNCS 2021, pages 135–152. Springer-Verlag, 2001.
G. Lowe. Quantifying information flow. In 15th IEEE Computer Security Foundations Workshop, pages 18–31. IEEE Computer Society, 2002.
H. Mantel. Preserving information flow properties under refinement. In IEEE Symposium on Security and Privacy, pages 78–91. IEEE Computer Society Press, 2001.
H. Mantel. On the composition of secure systems. In IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 2002. to appear.
C. Morgan, A. McIver, K. Seidel, and J.W. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617–647, 1996.
A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.
P.Y.A. Ryan and S.A. Schneider. Process algebra and non-interference. In 12th IEEE Computer Security Foundations Workshop, pages 214–227. IEEE Computer Society, 1999.
T. Santen, M. Heisel, and A. Pfitzmann. Compositionality of confidentiality-preserving refinement. Technical Report 10/2002, Technische Universität Berlin, 2002.
J. M. Spivey. The Z Notation-A Reference Manual. Prentice Hall, 2nd edition, 1992.
J.T. Wittbold and D.M. Johnson. Information flow in nondeterministic systems. In IEEE Symposium on Security and Privacy, pages 144–161. IEEE, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santen, T., Heisel, M., Pfitzmann, A. (2002). Confidentiality-Preserving Refinement is Compositional — Sometimes. In: Gollmann, D., Karjoth, G., Waidner, M. (eds) Computer Security — ESORICS 2002. ESORICS 2002. Lecture Notes in Computer Science, vol 2502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45853-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-45853-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44345-2
Online ISBN: 978-3-540-45853-1
eBook Packages: Springer Book Archive