无干扰会话逻辑关系
Session Logical Relations for Noninterference
摘要:
信息流控制类型的系统静态地限制敏感数据的传播,以确保端到端的机密性。要显示的属性是不干涉,断言攻击者不能从观察中推断出任何秘密。会话类型通过施加消息交换协议来限定可以沿着通信信道进行的观察的种类。这些协议管理沿单个信道的交换,而不约束沿相邻信道的传播。本文提出了一个线性会话类型的信息流控制型系统。类型系统与直觉线性逻辑紧密对应。直观的线性逻辑类型确保流程配置形成一个树,客户端流程是父结点,而提供者流程是子节点。为了控制秘密消息的传播,类型系统增加了保密级别,并将这些级别与配置树对齐。每个进程都有两个级别:最大机密性表示进程的安全许可,运行机密性表示迄今为止获得的最高机密信息级别。计算语义自然分层的进程配置,使高保密性的进程是较低保密性的父母,一个不变量强制类型。不干扰是根据逻辑关系来声明的,该逻辑关系由安全级别丰富的会话类型索引。逻辑关系为会话类型语言的逻辑关系提供了一种新的发展,因为它考虑了开放配置,允许更细致入微的等价语句。
英文摘要:
Information flow control type systems statically restrict the propagation of sensitive data to ensure end-to-end confidentiality. The property to be shown is noninterference, asserting that an attacker cannot infer any secrets from made observations. Session types delimit the kinds of observations that can be made along a communication channel by imposing a protocol of message exchange. These protocols govern the exchange along a single channel and leave unconstrained the propagation along adjacent channels. This paper contributes an information flow control type system for linear session types. The type system stands in close correspondence with intuitionistic linear logic. Intuitionistic linear logic typing ensures that process configurations form a tree such that client processes are parent nodes and provider processes child nodes. To control the propagation of secret messages, the type system is enriched with secrecy levels and arranges these levels to be aligned with the configuration tree. Two levels are associated with every process: the maximal secrecy denoting the process' security clearance and the running secrecy denoting the highest level of secret information obtained so far. The computational semantics naturally stratifies process configurations such that higher-secrecy processes are parents of lower-secrecy ones, an invariant enforced by typing. Noninterference is stated in terms of a logical relation that is indexed by the secrecy-level-enriched session types. The logical relation contributes a novel development of logical relations for session typed languages as it considers open configurations, allowing for more nuanced equivalence statement.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。