Abstract
Tse and Zdancewic have formalized the notion of noninterference for Abadi et al.’s DCC in terms of logical relations and given a proof by reduction to parametricity of System F. Unfortunately, their proof contains errors in a key lemma that their translation from DCC to System F preserves the logical relations defined for both calculi. We prove noninterference for a variant of DCC by reduction to the basic lemma of a logical relation for the simply typed λ-calculus, using a fully complete translation to the simply typed λ-calculus. Full completeness plays an important role in showing preservation of the two logical relations through the translation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Banerjee, A., Heintze, N., Riecke, J.G.: A core calculus of dependency. In: POPL 1999. Proceedings of 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 147–160. ACM Press, New York (1999)
de Groote, P.: On the strong normalisation of intuitionistic natural deduction with permutative-conversions. Information and Computation 178, 441–464 (2002)
Denning, D.E., Denning, P.J.: Certification of programs for secure information flow. Communications of the ACM 20(7), 504–513 (1977)
Girard, J.-Y Interprétation fonctionelle et élimination des coupures de l’arithmétique d’ordre supérieur. PhD thesis, Université Paris VII, A summary appeared in the Proceedings of the Second Scandinavian Logic Symposium Fenstad, J.E. (eds.). (pp. 63–92), North-Holland (1971)
Goguen, J., Meseguer, J.: Security policies and security models. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 11–20 (1982)
Hasegawa, M.: Girard translation and logical predicates. Journal of Functional Programming 10(1), 77–89 (2000)
Heintze, N., Riecke, J.G.: The SLam calculus: programming with secrecy and integrity. In: POPL 1998. Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 365–377 (1998)
Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)
Mitchell, J.C.: Foundations for Programming Languages. The MIT Press, Cambridge (1996)
Miyamoto, K., Igarashi, A.: A modal foundation for secure information flow. In: FCS 2004. Proceedings of Workshop on Foundations of Computer Security, pp. 187–203 (June 2004)
Moggi, E.: Notions of computation and monads. Information and Computation 1, 55–92 (1991)
Pottier, F., Simonet, V.: Information flow inference for ML. ACM Transactions on Programming Languages and Systems 25(1), 117–158 (2003)
Reynolds, J.: Towards a theory of type structure. In: Robinet, B. (ed.) Programming Symposium. LNCS, vol. 19, pp. 408–425. Springer, Heidelberg (1974)
Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: IFIP Congress, pp. 513–523 (1983)
Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE Journal On Selected Areas In Communications 21(1), 5–19 (2003)
Tang, Y.M., Jouvelot, P.: Effect systems with subtyping. In: PEPM 1995. Proceedings of ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 45–53 (1995)
Tse, S., Zdancewic, S.: Translating dependency into parametricity. In: ICFP 2004. Proceedings of 9th ACM International Conference on Functional Programming, pp. 115–125. ACM Press, New York (2004)
Wadler, P.: Theorems for free. In: FPCA 1989. Proceedings 4th Int.Conf. on Funct. Prog. Languages and Computer Arch. pp. 347–359. ACM Press, New York (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shikuma, N., Igarashi, A. (2007). Proving Noninterference by a Fully Complete Translation to the Simply Typed λ-Calculus. In: Okada, M., Satoh, I. (eds) Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues. ASIAN 2006. Lecture Notes in Computer Science, vol 4435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77505-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-77505-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77504-1
Online ISBN: 978-3-540-77505-8
eBook Packages: Computer ScienceComputer Science (R0)