Proving noninterference by a fully complete translation to the simply typed λ-calculus

Authors:
Naokata Shikuma;Atsushi Igarashi
Affiliations:
Graduate School of Informatics, Kyoto University;Graduate School of Informatics, Kyoto University
Venue:
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Year:
2006

Citing 13
Cited 0

Theorems for free!

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Notions of computation and monads

Information and Computation
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Effect systems with subtyping

PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Foundations of programming languages

Foundations of programming languages
The SLam calculus: programming with secrecy and integrity

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A core calculus of dependency

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Certification of programs for secure information flow

Communications of the ACM
Information flow inference for ML

ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards a theory of type structure

Programming Symposium, Proceedings Colloque sur la Programmation
Girard translation and logical predicates

Journal of Functional Programming
Translating dependency into parametricity

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Language-based information-flow security

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.