A simple view of type-secure information flow in the π-calculus

Proceedings of the Computer Security Foundations Workshop

Volumn 2002-January, Issue , 2002, Pages 320-330

  Pottier, F ^a  

^a INRIA   (France)

Author keywords

Calculus; Computer security; Conferences; Encoding; Information analysis; Leak detection; Safety; Timing

Indexed keywords

ACCIDENT PREVENTION; ENCODING (SYMBOLS); INFORMATION ANALYSIS; LEAK DETECTION; SECURITY OF DATA; SECURITY SYSTEMS;

CALCULUS; CONFERENCES; INFORMATION FLOW CONTROL; NONINTERFERENCE PROPERTIES; PROCESS EQUIVALENCE; SECURE INFORMATION FLOW; STATIC TYPE SYSTEMS; TIMING;

CALCULATIONS;

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

References (28)

1. M. Abadi, A. Banerjee, N. Heintze, and J. G. Riecke. A core calculus of dependency. In Conference Record of the 26th ACM Symposium on Principles of Programming Languages, pages 147-160, San Antonio, Texas, Jan. 1999. ACM Press. URL: http://www.soe.ucsc.edu/~abadi/Papers/flowpopl.ps.
2. M. Abadi, B. Lampson, and J.-J. Lévy. Analysis and caching of dependencies. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, pages 83-91, Philadelphia, Pennsylvania, May 1996. ACM Press. URL: http://www.soe.ucsc.edu/~abadi/Papers/make-preprint.ps.
3. D. E. Bell and L. J. LaPadula. Secure computer systems: Unified exposition and Multics interpretation. Technical Report MTR-2997, The MITRE Corp., Bedford, Massachusetts, July 1975. URL: http://www.mitre.org/resources/centers/infosec/infosec.html.
4. C. Bodei, P. Degano, F. Nielson, and H. R. Nielson. Static analysis of processes for no read-up and no write-down. In W. Thomas, editor, Proceedings of FoSSaCS'99, volume 1578 of Lecture Notes in Computer Science, pages 120-134. Springer, Mar. 1999. URL: http://www.di.unipi.it/~chiara/publ-40/BDNN99.ps.
5. G. Boudol and I. Castellani. Non-interference for concurrent programs and thread systems. To appear. URL: ftp://ftp-sop.inria.fr/mimosa/personnel/gbo/non-interf-threads.ps.gz, Sept. 2001.
6. D. E. Denning. Cryptography and Data Security. Addison-Wesley, Reading, Massachusetts, 1982.
7. R. Focardi and R. Gorrieri. A classification of security properties for process algebras. Journal of Computer Security, 3(1):5-33, 1995. URL: http://www.cs.unibo.it/~gorrieri/Papers/jcsfinal.ps.gz.
8. M. Hennessy. The security picalculus and noninterference. Technical Report 2000:05, University of Sussex, Nov. 2000. URL: ftp://ftp.cogs.susx.ac.uk/pub/reports/compsci/cs052000.ps.Z.
9. M. Hennessy and J. Riely. Information flow vs. resource access in the asynchronous pi-calculus. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science. Springer-Verlag, July 2000. URL: http://www.depaul.edu/~jriely/papers/00icalp.ps.gz.
10. M. Hepburn and D. Wright. Trust in the pi-calculus. In Third International Conference on Principles and Practice of Declarative Programming (PPDP'01), Sept. 2001.
11. K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as typed process behaviour. In G. Smolka, editor, Proceedings of the 2000 European Symposium on Programming (ESOP'00), volume 1782 of Lecture Notes in Computer Science, pages 180-199. Springer Verlag, Mar. 2000. URL: ftp://ftp.dcs.qmw.ac.uk/lfp/kohei/siftp-esop00.ps.gz.
12. K. Honda and N. Yoshida. A uniform type structure for secure information flow. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages (POPL'02), pages 81-92, Portland, Oregon, Jan. 2002. URL: http://www.mcs.le.ac.uk/~nyoshida/paper/ifa1.ps.gz.
13. A. Igarashi and N. Kobayashi. Type reconstruction for linear π-calculus with I/O subtyping. Information & Computation, 161:1-44, Aug. 2000. URL: http://www.graco.c.u-tokyo.ac.jp/~igarashi/papers/LinearPi.ps.gz.
14. N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the Pi-Calculus. ACM Transactions on Programming Languages and Systems, 21(5):914-947, Sept. 1999. URL: http://www.acm.org/pubs/citations/journals/toplas/1999-21-5/p914-kobayashi/.
15. J. McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proceedings of the 1994 IEEE Symposium on Research in Security and Privacy. IEEE Press, 1994. URL: http://chacs.nrl.navy.mil/publications/CHACS/1994/1994mclean-sp.ps.
16. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, Oct. 1991. URL: ftp://ftp.cl.cam.ac.uk/users/rm135/ppi.ps.Z.
17. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, International Colloquium on Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science, pages 685-695, Vienna, Austria, July 1992. Springer-Verlag. URL: ftp://ftp-sop.inria.fr/meije/theorie-par/davides/bn.ps.gz.
18. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pages 376-385, June 1993. URL: http://www.cis.upenn.edu/~bcpierce/papers/pi-lics.ps.
19. F. Pottier. A simple view of type-secure information flow in the π-calculus. Full version. URL: http://pauillac.inria.fr/~fpottier/publis/fpottier-csfw15-long.ps.gz, Feb. 2002.
20. F. Pottier and S. Conchon. Information flow inference for free. In Proceedings of the the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 46-57, Montréal, Canada, Sept. 2000. ACM Press. URL: http://pauillac.inria.fr/~fpottier/publis/fpottier-conchon-icfp00.ps.gz.
21. F. Pottier and V. Simonet. Information flow inference for ML. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages (POPL'02), pages 319-330, Portland, Oregon, Jan. 2002. ACM Press. URL: http://pauillac.inria.fr/~fpottier/publis/fpottier-simonet-popl02.ps.gz.
22. P. Sewell and J. Vitek. Secure composition of untrusted code: Wrappers and causality types. In Proceedings of the 13th Computer Security Foundations Workshop. IEEE Computer Society Press, July 2000. URL: http://www.cl.cam.ac.uk/users/pes20/wraptypes.ps.gz.
23. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Conference Record of the 25th ACM Symposium on Principles of Programming Languages, pages 355-364, Jan. 1998. URL: http://www.cs.nps.navy.mil/people/faculty/volpano/papers/popl98.ps.Z.
24. G. S. Smith. A new type system for secure information flow. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 115-125, Cape Breton, Nova Scotia, June 2001. URL: http://www.cs.fiu.edu/~smithg/papers/csfw01.ps.gz.
25. N. Yoshida. Graph types for monadic mobile processes. In V. Chandru and V. Vinay, editors, Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lecture Notes in Computer Science, pages 371-386. Springer-Verlag, 1996. URL: http://www.mcs.le.ac.uk/~nyoshida/paper/graph1-short.ps.gz.
26. N. Yoshida, K. Honda, and M. Berger. Linearity and bisimulation. Technical Report MSC-2001/48, University of Leicester, Dec. 2001. URL: http://www.mcs.le.ac.uk/~nyoshida/paper/lb.ps.gz.
27. N. Yoshida, K. Honda, and M. Berger. Linearity and bisimulation. In Proceedings of 5th International Conference of Foundations of Software Science and Computer Structures (FoSSaCs 2002), Lecture Notes in Computer Science. Springer Verlag, Apr. 2002. URL: http://www.mcs.le.ac.uk/~nyoshida/paper/fossacs-ca-final.ps.gz.
28. S. Zdancewic and A. C. Myers. Secure information flow and CPS. In D. Sands, editor, Proceedings of the 2001 European Symposium on Programming (ESOP'01), Lecture Notes in Computer Science, Genova, Italy, Apr. 2001. Springer Verlag. URL: http://www.cs.cornell.edu/zdance/lincont.ps.