Approximate non-interference

Proceedings of the Computer Security Foundations Workshop

Volumn 2002-January, Issue , 2002, Pages 3-17

  Di Pierro, A ^a   Hankin, C ^b   Wiklicky, H ^b  

^a UNIVERSITY OF PISA   (Italy)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Computer languages; Computer security; Conferences; Educational institutions; Information security; Parallel processing; Power system security; System testing

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; SECURITY SYSTEMS; SEMANTICS;

CONFERENCES; EDUCATIONAL INSTITUTIONS; PARALLEL PROCESSING; POWER SYSTEM SECURITY; SYSTEM TESTING;

SECURITY OF DATA;

EID: 84948746951     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2002.1021803     Document Type: Conference Paper

References (27)

1. P. Billingsley. Probability and Measure. Wiley & Sons, New York, 2nd edition, 1986.
2. D. Clark, S. Hunt, and P. Malacaria. private communication. July 2001.
3. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Symposium on Principles of Programming Languages (POPL), pages 238-252, Los Angeles, 1977.
4. F.S. de Boer, A. Di Pierro, and C. Palamidessi. Nondeterminism and Infinite Computations in Constraint Programming. Theoretical Computer Science, 151(1):37-78, 1995.
5. A. Di Pierro, C. Hankin, and H. Wiklicky. Probabilistic confinement in a declarative framework. In Declarative Programming - Selected Papers from AGP 2000 - La Havana, Cuba, volume 48 of Electronic Notes in Theoretical Computer Science, pages 1-23. Elsevier, 2001.
6. A. Di Pierro and H. Wiklicky. An operational semantics for Probabilistic Concurrent Constraint Programming. In P. Iyer, Y. Choo, and D. Schmidt, editors, ICCL'98 - International Conference on Computer Languages, pages 174-183. IEEE Computer Society Press, 1998.
7. A. Di Pierro and H. Wiklicky. Probabilistic Concurrent Constraint Programming: Towards a fully abstract model. In L. Brim, J. Gruska, and J. Zlatuska, editors, MFCS'98 - Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 446-455, Berlin - New York, August 1998. Springer Verlag.
8. J. Goguen and J. Meseguer. Security Policies and Security Models. In IEEE Symposium on Security and Privacy, pages 11-20. IEEE Computer Society Press, 1982.
9. J. W. Gray, III. Probabilistic interference. In Proceedings of the IEEE Symposium on Security and Privacy, pages 170-179. IEEE Computer Society Press, 1990.
10. C. M. Grinstead and J.L. Snell. Introduction to Probability. American Mathematical Society, Providence, Rhode Island, second revised edition, 1997.
11. P. C. Kocher. Cryptanalysis of Diffie-Hellman, RSA, DSS, and other cryptosystems using timing attacks. In D. Coppersmith, editor, Advances in Cryptology, CRYPTO '95: 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, volume 963 of Lecture Notes in Computer Science, pages 171-183, Berlin - Heidelberg - London, 1995. Springer-Verlag.
12. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
13. P. D. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Conference on Computer and Communication Security (CCS-5), 1998.
14. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate confinement under uniform attacks. submitted for publication.
15. P.Y.A. Ryan, J. McLean, J. Millen, and V. Gilgor. Non-interference, who needs it? In Proceedings of the 14th IEEE Computer Security Foundations Workshop, pages 237-238, Cape Breton, Nova Scotia, Canada, June 2001. IEEE.
16. P.Y.A. Ryan and S.A. Schneider. Process algebra and non-interference. Journal of Computer Security, 9(1/2):75-103, 2001. Special Issue on CSFW-12.
17. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. In ESOP'99, number 1576 in Lecture Notes in Computer Science, pages 40-58. Springer Verlag, 1999.
18. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. InProceedings of the 13th IEEE Computer Security Foundations Workshop, pages 200-214, 2000.
19. V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Symposium on Principles of Programming Languages (POPL), pages 232-245. ACM, 1990.
20. V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of concurrent constraint programming. In Symposium on Principles of Programming Languages (POPL), pages 333-353. ACM, 1991.
21. J. Shao. Mathematical Statistics. Springer Texts in Statistics. Springer Verlag, New York - Berlin - Heidelberg, 1999.
22. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Symposium on Principles of Programming Languages (POPL'98), pages 355-364, San Diego, California, 1998. ACM.
23. G. Smith and D. Volpano. Verifying secrets and relative secrecy. In Symposium on Principles of Programming Languages (POPL'00), pages 368-276, Boston, Massachusetts, 2000. ACM.
24. F. van Breugel and J. Worrell. Towards quantitative verification of probabilistic transition systems. In ICALP: 28th International Colloquium on Automata, Languages and Programming, volume 2076 of Lecture Notes in Computer Science, pages 421-432. Springer Verlag, 2001.
25. D. Volpano and G. Smith. Confinement properties for programming languages. SIGACTNews, 29(3):33-42, September 1998.
26. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. In Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW '98), pages 34-43, Washington - Brussels - Tokyo, June 1998. IEEE.
27. D. G. Weber. Quantitative hook-up security for covert channel analysis. In Proceedings of the 1988 Workshop on the Foundations of Computer Security, Franconia, New Hampshire, 1988.