JavaScript is disabled for your browser. Some features of this site may not work without it.
RIF: Reactive Information Flow Labels

Author
Kozyri, Elisavet; Schneider, Fred B.
Abstract
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.
Date Issued
2019-04-08Subject
information flow control; reclassification; piesewise noninterference
Rights
Attribution-NonCommercial-ShareAlike 4.0 International
Type
technical report
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-ShareAlike 4.0 International