A uniform type structure for secure information flow

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 6, 2007, Pages

  Honda, Kohei ^a   Yoshida, Nobuko ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Secure information flow; The calculus; Type based program analysis; Typing system

Indexed keywords

DEPENDENCY CORE CALCULUS (DCC); SECURE INFORMATION FLOW; TYPE BASED PROGRAM ANALYSIS; TYPING SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES; MOBILE TELECOMMUNICATION SYSTEMS; SECURITY SYSTEMS; SYSTEMS ANALYSIS;

INFORMATION SYSTEMS;

EID: 36048945344     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1286821.1286822     Document Type: Article

References (73)

1. ABADI, M. 1999. Secrecy in programming-language semantics. Electr. Notes Theor. Comput. Sci. 20, 1 (Jan.), 1-15.
2. ABADI, M., BANERJEE, A., HEINTZE, N., AND RIECKE, J. G. 1999. A core calculus of dependency. In Proceedings of the 26th Annual Symposium on Principles of Programming Languages. ACM, New York, 147-160.
3. ABHAMSKY, S., HONDA, K., AND MCCUSKEH, G. 1998. Fully abstract game semantics for general references. In Proceedings of the Conference on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 334-344.
4. ABRAMSKT, S., JAGADEESAN, R., AND MALACARIA, P. 2000. Full abstraction for PCF. Inf. Comput. 163, 409-470.
5. AMTOPT, T., NIELSON, P., AND NIELSON, H. R. 1999. Type and Effect Systems: Behaviours for Concurrency. Imperial College Press.
6. BELL, D. E. AND LA PADULA, L. 1973. Secure computer systems: Mathematical foundations. Tech. Rep. MTR-2547, Computer Laboratory, University of Cambridge, Cambridge, MA, March.
7. BERGER, M., HONDA, K., AND YOSHIDA, N. 2000. Sequentiality and the π -calculus. Full version of [Berger et al. 2001].
8. BERGER, M., HONDA, K., AND YOSHIDA, N. 2001. Sequentially and the π-calculus. In Proceedings of TLCA'01. Lecture Notes in Computer Science, vol. 2044. Springer-Verlag, New York, 29-45.
9. BERGER, M., HONDA, K., AND YOSHIDA, N. 2005. Genericity and the π-calculus. Acta Inf. 42, 2-3, 83-141.
10. BODEI, C., DEGANO, P., NIELSON, P., AND NIELSON, H. R. 1998. Control flow analysis for the picalculus. In CONCUR. Lecture Notes in Computer Science, vol. 1466. Springer-Verlag, New York, 84-98.
11. BODEI, C., DEGANO, P., NIELSON, P., AND NIELSON, H. R. 1999. Static analysis of processes for no read-up and no write-down. In FoSSaCS. Lecture Notes in Computer Science, vol. 1578. Springer-Verlag, New York, 120-134.
12. BOUDOL, G. 1992. Asynchrony and the pi-calculus. Tech. Rep. 1702, INRIA.
13. BOUDOL, G. AND CASTELLANI, I. 2002. Noninterference for concurrent programs and thread systems. Theoret. Comput. Sci. 281, 1-2, 109-130.
14. DAMAS, L. 1985. Type assignment in programming languages. Ph.D. dissertation, University of Edinburgh, Edinburgh, Scotland.
15. DENNING, D. E. AND DENNING, P. J. 1977. Certification of programs for secure information flow. Commun. ACM 20, 7, 504-513.
16. FIORE, M. 1994. Axiomatic domain theory in cagtegory of partial maps. Ph.D. dissertation, University of Edinburgh, Edinburgh, Scotland.
17. FIORE, M. P. AND HONDA, K. 1998. Recursive types in games: Axiomatics and process representation. In Proceedings of the Conference on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 345-356.
18. FOCARDI, R., GORRIERI, R., AND MARTINELLI, F. 2000. Non interference for the analysis of cryptographic protocols. In Proceedings of the International Colloquium on Antomata, Languages and Programming. Lecture Notes in Computer Science, vol. 1853. Springer-Verlag, New York, 354-372.
19. GIRARD, J.-Y. 1987. Linear logic. Theoret. Comput. Sci. 50, 1-102.
20. HEINTZE, N. AND RIECKE, J. G. 1998. The slam calculus: Programming with secrecy and integrity. In Proceedings of the 25th Annual Symposium on Principles of Programming Languages. ACM, New York, 365-377.
21. HENNESSY, M. AND RIELY, J. 2000. Information flow vs. resource access in the asynchronous picalculus. In Proceedings of the International Colloquium on Antomata, Languages and Programming. Lecture Notes in Computer Science, vol. 1853. Springer-Verlag, New York, 415-427.
22. HONDA, K. 1993. Types for Dyadic Interaction. In CONCUR'93. Lecture Notes in Computer Science, vol. 715. Springer-Verlag, New York, 509-523.
23. HONDA, K. 1996. Composing Processes. In Proceedings of the Symposium on Principles of Programming Languages. ACM, New York, 344-357.
24. HONDA, K. AND TOKORO, M. 1991. An object calculus for asynchronous communication. In Proceedings of European Conference on Object-Oriented Programming. Lecture Notes in Computer Science, vol. 512. Springer-Verlag, New York, 133-147.
25. HONDA, K., VASCONCELOS, V. T., AND KUBO, M. 1998. Language primitives and type disciplines for structured communication-based programming. In Proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol. 1381. Springer-Verlag, New York, 22-138.
26. HONDA, K., VASCONCELOS, V. T., AND YOSHIDA, N. 2000. Secure information flow as typed process behavior. In Proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol. 1782. Springer-Verlag, New York, 180-199.
27. HONDA, K. AND YOSHIDA, N. 1995. On reduction-based process semantics. Theoret. Comput. Sci. 151, 437-486.
28. HONDA, K. AND YOSHIDA, N. 1999. Game-theoretic analysis of call-by-value computation. Theoret. Comput. Sci. 221, 393-456.
29. HONDA, K. AND YOSHIDA, N. 2002. A uniform type structure for secure information flow. In Proceedings of the Symposium on Principles of Programming Languages. ACM, New York, 81-92.
30. HONDA, K. AND YOSHIDA, N. 2003. Addendum to "Uniform type structure for secure information flow": Subject reduction with inflation. Available at http://www.doc.ic.ac.uk/~yoshida.
31. HONDA, K. AND YOSHIDA, N. 2005. Noninterference through flow analysis. J. Funct. Program,. 15, 2 (Mar.), 293-349.
32. HONDA, K., YOSHIDA, N., AND BERGER, M. 2004. Control in the π-calculus. In Proceedings ofCW'04. ACM, New York.
33. HOWARD, B. T. 1996. Inductive, coinductive, and pointed types. In Proceedings of'ICFF96. ACM, New York, 102-109.
34. HUDAK, P., JONES, S., AND WADLER, P. 1992. The Haskell home page, http://haskell.org.
35. HYLAND, J. M. E. AND ONG, C-H. L. 1995. Pi-calculus, dialogue games and PCF. In Proceedings of FPCA. ACM Press, 96-107.
36. HYLAND, J. M. E. AND ONG, C. H. L. 2000. On full abstraction for PCF. Inf. Comput. 163, 285-408.
37. JONES, C. B. 1983a. Specification and design of (parallel) programs. In IFIP Congress. North-Holland, Amsterdam, The Netherlands. 321-332.
38. JONES, C. B. 1983b. Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5, 4, 596-619.
39. KOBAYASHI, N., PIERCE, B. C., AND TURNER, D. N. 1999. Linearity and the Pi-calculus. ACM Trans. Program. Lang. Syst. 21, 5 (Sept.), 914-947.
40. LAMPSON, B. W. 1973. A note on the confinement problem. Commun. ACM 16, 10, 613-615.
41. LEROY, X. AND WEIS, P. 1991. Polymorphic type inference and assignment. In POPL '91: Proceedings of the 18th ACM SIOPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 291-302.
42. MILNER, R. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer, Berlin, Germany.
43. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ.
44. MILNER, R. 1992a. Functions as processes. Math. Struct. Comput. Sci. 2, 2,119-141.
45. MILNER, R. 1992b. The polyadic n -calculus: A tutorial. In Proceedings of the International Summer School on Logic Algebra of Specification. Marktoberdorf.
46. MILNER, R., PARROW, J., AND WALKER, D. 1992. A calculus of mobile processes, Parts I and II. Inf. Comput. 100, 1, 1-77.
47. MILNER, R., TOPTE, M., AND HARPER, R. W 1990. The Definition of Standard ML. MIT Press, Cambridge, MA.
48. MITCHELL, J. C. 1996. Foundations for Programming Languages. MIT Press, Cambridge, MA.
49. MOGGI, E. 1991. Notions of computation and monads. Inf. Comput. 93, 1, 55-92.
50. MYERS, A. C. 1999. Jflow: Practical mostly-static information flow control. In Proceedings of 26th Symposium on Principles of Programming Languages. ACM, New York, 228-241.
51. NIELSON, F., NIELSON, H. R., AND HANKIN, C. 1999. Proceedings of the Symposium on Principles of Program Analysis. Springer-Verlag, New York.
52. ØRBÆK, P. AND PALSBERG, J. 1997. Trust in the lambda-calculus. J. Funct. Program. 7, 6, 557-591.
53. PALSBERG, J. 2001. Type-based analysis and applications. In Proceedings of the Workshop on Progeam Analysis for Software Tools and Engineering. ACM, New York, 20-27.
54. PIERCE, B. AND SANGIORGI, D. 1996. Typing and subtyping for mobile processes. Math. Struct. Comput. Sci. 6, 5, 409-454.
55. PIERCE, B. C. 2002. Types and Programming Languages. MIT Press, Cambridge, MA.
56. POTTIER, F. 2002. A simple view of type-secure information flow in the π -calculus. In Proceedings of CSFW. IEEE Computer Society Press, Los Alamitos, CA, 320-330.
57. POTTIER, F. AND CONCHON, S. 2000. Information flow inference for free. In Proceedings of ICFP'00. (Montral, Canada). ACM, New York, 46-57.
58. POTTIER, F. AND SIMONET, V. 2003. Information flow inference for ML. ACM Trans. Program. Lang. Syst. 25, 1 (Jan.), 117-158.
59. RYAN, P. Y. A. AND SCHNEIDER, S. A. 1999. Process algebra and non-interference. In Proceedings of CSFW. IEEE Computer Society Press, Los Alamitos, CA, 214-227.
60. SABELPELD, A. AND SAND, D. 1999. A per model of secure information flow in sequential programs. In Proceedings of the European Symposium. on Programming. Number 1576 in Lecture Notes in Computer Science, vol. 1576. Springer-Verlag, New York, 40-58.
61. SMITH, G. 2001. A new type system for secure information flow. In Proceedings of CSFW. IEEE, New York.
62. SMITH, G. AND VOLPANO, D. 1998. Secure information flow in a multi-threaded imperative language. In POPL '98: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 355-364.
63. TALPIN, J.-P. AND JOUVELOT, P. 1992. The type and effect discipline. In Proceedings of the Conference on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 162-173.
64. TOPTE, M. 1990. Type inference for polymorphic references. Inf. Comput. 89, 1-34.
65. TSE, S. AND ZDANCEWIC, S. 2004. Translating dependency into parametricity. In Proceedings of ICFP'04. ACM, New York, 115-125.
66. VOLPANO, D., IRVINE, C., AND SMITH, G. 1996. A sound type system for secure flow analysis. J. Comput. Secur. 4, 2,3, 167-187.
67. WRIGHT, A. 1994. Typing references by effect inference. In Proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol. 582. Springer-Verlag, New York, 473-491.
68. YOSHIDA, N. 1996. Graph types for monadic mobile processes. In Proc. FSTTCS'96. Lecture Notes in Computer Science, vol. 1180. Springer-Verlag, New York, 371-386. (The full version as LFCS Technical Report, University of Edinburgh, ECS-LFCS-96-350, 1996).
69. YOSHIDA, N. 2002. Type-based liveness guarantee in the presence of nontermination and nondeterminism. In PPL '03, Proc. of JSST Workshop Programming and Program Language. JSST, 32-46. MCS Technical Report, 2002-20, University of Leicester. Available at www.doc.ic.ac.uk/~yoshida.
70. YOSHIDA, N., BERGER, M., AND HONDA, K. 2004. Strong Normalization in the π -Calculus. Inf. Comput. 191, 145-202.
71. YOSHIDA, N., HONDA, K., AND BERGER, M. 2002. Linearity and bisimulation. In Proceedings of FoSSaCs02. Lecture Notes in Computer Science, vol. 2303. Springer-Verlag, New York, 417-433. (A full version in Journal of Logic and Algebraic Programming.)
72. ZDANCEWIC, S. AND MYERS, A. C. 2001. Secure information flow and CPS. In Proceedings of the European Symposium on Programming. Lecture Notes in Computer Science, vol. 2028. Springer-Verlag, New York, 46-62.
73. ZDANCEWIC, S. AND MYERS, A. C. 2003. Observational determinism for concurrent program security. In Proceedings of CSFW. IEEE Computer Society Press, Los Alamitos, CA, 29-45.