Scheduler-independent declassification

DOI10.1007/978-3-642-31113-0_4MaRDI QIDQ2908558zbMATH OpenOpenAlexFDO

Authors Alexander Lux, Heiko Mantel, Matthias Perner

Publication date 5 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31113-0_4

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Data encryption (aspects in computer science) (68P25)

Recommendations

• Linear Declassification
• A type system for robust declassification
• Who Can Declassify?
• What you lose is what you leak: information leakage in declassification policies
• Information flow in systems with schedulers. I: Definitions

Cites work

• Controlling the What and Where of Declassification in Language-Based Security
• Downgrading policies and relaxed noninterference
• Non-interference through determinism
• Paralocks, role-based information flow control and beyond
• Programming Languages and Systems
• Programming Languages and Systems
• Securing interaction between threads and the scheduler in the presence of synchronization
• The Shadow Knows: Refinement of Ignorance in Sequential Programs
• Who Can Declassify?

Cited in

(5)

• Automated enforcement for relaxed information release with reference points
• Robust declassification by incremental typing
• Who Can Declassify?
• Linear Declassification
• A Formalization of Declassification with WHAT-and-WHERE-Security

This page was built for publication: Scheduler-independent declassification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908558)