RIF: Reactive Information Flow Labels
No Access Until
Restrictions that a reactive information flow (RIF) label imposes on a value are determined by the sequence of operations used to derive that value. This allows declassification, endorsement, and other forms of reclassification to be supported in a uniform way. Piecewise noninterference (PWNI) is introduced as a fitting security policy, because noninterference is not suitable. A type system is given for static enforcement of PWNI in programs that associate checkable classes of RIF labels with variables. Two checkable classes of RIF labels are described: RIF automata are general-purpose and based on finite-state automata; κ-labels concern confidentiality in programs that use cryptographic operations.
Journal / Series
Volume & Issue
information flow control; reclassification; piesewise noninterference
Number of Workers
Based on Related Item
Has Other Format(s)
Part of Related Item
Link(s) to Related Publication(s)
Link(s) to Reference(s)
Previously Published As
Attribution-NonCommercial-ShareAlike 4.0 International
Link(s) to Catalog Record
You are currently viewing version 2 of the item.