In the context of the modal logic of security, confidentiality is defined by the formula K/sub B/ phi to R/sub B/ phi that could be read 'If B knows phi then B should have the permission to know phi '. The authors propose a new semantics for the R/sub B/ modal operator, such that the definition of security would allow a certain number of dependencies (called secure dependencies) between objects of the system. They formally compare this definition of security with non-interference, non-deducibility and generalized non-interference, especially with respect to assumptions on the systems as non-determinism and input-totalness.
展开▼
机译:在安全的模态逻辑的上下文中,机密性由公式k / sub b / phi定义为r / sub b / phi,它可以读取的'如果b知道phi,则b应该有允许知道phi'。作者提出了R / SUB B /模态运算符的新语义,使得安全的定义将允许系统的对象之间的一定数量的依赖关系(称为安全依赖关系)。它们与非干扰,非转化性和广义的非干扰正式化了这种安全性的定义,特别是关于系统上的假设作为非确定性和输入总和。
展开▼