Scheduler-independent declassification

DOI10.1007/978-3-642-31113-0_4zbMATH Open1358.68065OpenAlexW2186572398MaRDI QIDQ2908558FDOQ2908558

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Automated enforcement for relaxed information release with reference points
• Linear Declassification
• Who Can Declassify?

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)