A formal framework for confidentiality-preserving refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4189 LNCS, Issue , 2006, Pages 225-242

  Santen, Thomas ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; PROCESS CONTROL;

PROBABILISTIC SYSTEMS; REFINEMENT RELATIONS;

FORMAL LOGIC;

EID: 33750235645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11863908_15     Document Type: Conference Paper

References (32)

1. J.-R. Abrial. The B-Book: Assigning programs to meanings. Cambridge University Press, 1996.
2. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations (extended abstract). In Proc. 10th ACM Conference on Computer and Communications Security, pages 220-230, 2003.
3. M. Backes, B. Pfitzmann, and M. Waidner. Secure asynchronous reactive systems. IACR ePrint Archive, March 2004. Online available at http://eprint.iacr.org/2004/082.ps.
4. P. Behm, P. Benoit, A. Faivre, and J.-M. Meynadier. Météor: A successful application of B in a large project. In J. Wing, J. Woodcock, and J. Davies, editors, FM'99 - Formal Methods, volume I of LNCS 1708, pages 369-387. Springer-Verlag, 1999.
5. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symposium on Foundations of Computer Science, pages 136-145, 2001.
6. F. Ciesinski and M. Größer. On probabilistic computation tree logic. In C. Baier, B. R. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors, Validation of Stochastic Systems: A Guide to Current Research, LNCS 2925, pages 147-188. Springer-Verlag, 2004.
7. J. Derrick and E. Boiten. Refinement in Z and Object-Z. Springer-Verlag, London, 2001.
8. 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.
9. J. W. Gray, III. Toward a mathematical foundation for information flow security. Journal of Computer Security, pages 255-294, 1992.
10. 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.
11. C. A. R. Hoare. Proof of correctness of data representations. Acta Informatica, 1:271-281, 1972.
12. J.Jacob. On the derivation of secure components. In IEEE Symposium on Security and Privacy, pages 242-247. IEEE Press, 1989.
13. C. B. Jones. Systematic Software Development using VDM. Prentice Hall, 2nd edition, 1990.
14. 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.
15. B. Liskov and J. Wing. A behavioral notion of subtyping. ACM Transactions on Programming Languages and Systems, 16(6):1811-1841, 1994.
16. G. Lowe. Quantifying information flow. In 15th IEEE Computer Security Foundations Workshop, pages 18-31. IEEE Computer Society, 2002.
17. D. MacKay. Information Theory, Inference, and Learning Algorithms. Cambridge University Press, 2003.
18. H. Mantel. Preserving information flow properties under refinement. In IEEE Symposium on Security and Privacy, pages 78-91. IEEE Computer Society Press, 2001.
19. H. Mantel. A Uniform Framework for the Formal Specification and Verification of Information Flow Security. PhD thesis, Universität des Saarlandes, 2003.
20. J. McLean. A general theory of composition for a class of "possibilistic" properties. IEEE Transactions on Software Engineering, 22(1):53-67, 1996.
21. B. Meyer. Applying "design by contract". IEEE Computer, pages 40-51, October 1992.
22. C. Morgan, A. McIver, K. Seidel, and J. W. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617-641, 1996.
23. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Security and Privacy, pages 184-201. IEEE Computer Society, 2001.
24. A. W. Roscoe. CSP and determinism in security modelling. In Proc. IEEE Symposium on Security and Privacy, pages 114-127. IEEE Computer Society Press, 1995.
25. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.
26. A. W. Roscoe, J. C. P. Woodcock, and L. Wulf. Non-interference through determinism. In D. Gollmann, editor, European Symposium on Research in Computer Security (ESORICS), LNCS 875, pages 33-53. Springer-Verlag, 1994.
27. 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.
28. T. Santen. Probabilistic confidentiality properties based on indistinguishability. In H. Federrath, editor, Proc. Sicherheit 2005 - Schutz und Zuverlässigkeit, Lecture Notes in Informatics, pages 113-124. Gesellschaft für Informatik, 2005.
29. T. Santen, M. Heisel, and A. Pfitzmann. Confidentiality-preserving refinement is compositional - sometimes. In D. Gollmann, G. Karjoth, and M. Waidner, editors, Computer Security - ESORICS 2002, LNCS 2502, pages 194-211. Springer-Verlag, 2002.
30. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
31. A. Zakinthinos and E. S. Lee. A general theory of security properties. In Proc. IEEE Symposium on Security and Privacy, pages 94-102, 1997.
32. P. Zave and M. Jackson. Four dark corners of requirements engineering. ACM Transactions on Software Engineering and Methodology, 6(1):1-30, 1997.