Linear declassification

Authors:
Yûta Kaneko;Naoki Kobayashi
Affiliations:
Graduate School of Information Sciences, Tohoku University;Graduate School of Information Sciences, Tohoku University
Venue:
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Year:
2008

Citing 14
Cited 0

Once upon a type

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Secure information flow in a multi-threaded imperative language

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Quasi-linear types

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transforming out timing leaks

Proceedings of the 27th 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

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types for 0, 1 or Many Uses

IFL '97 Selected Papers from the 9th International Workshop on Implementation of Functional Languages
Lambda calculi and linear speedups

The essence of computation
Downgrading policies and relaxed noninterference

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dimensions and Principles of Declassification

CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Quantitative Information Flow, Relations and Polymorphic Types

Journal of Logic and Computation
Assessing security threats of looping constructs

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A static analysis for quantifying information flow in a simple imperative language

Journal of Computer Security
Language-based information-flow security

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new notion of declassification policy called linear declassification. Linear declassification controls not only which functions may be applied to declassify high-security values, but also how often the declassification functions may be applied. We present a linear type system which guarantees that well-typed programs never violate linear declassification policies. To state a formal security property guaranteed by the linear declassification, we also introduce linear relaxed non-interference as an extension of Li and Zdancewic's relaxed non-interference. An application of the linear relaxed non-interference to quantitative information flow analysis is also discussed.