摘要: In the context of modal logic security, confidentiality is defined by formula KBφ→RBφ that could be read “If B knows φ then should have permission to know φ”. We propose a new semantics for RB operator, such definition security would allow certain number dependencies (called secure dependencies) between objects system. formally compare this with non-interference, non-deducibility and generalized especially respect assumptions non-determinism input-totalness.