首页> 外文会议>IEEE Computer Security Foundations Symposium >Assuming You Know: Epistemic Semantics of Relational Annotations for Expressive Flow Policies
【24h】

Assuming You Know: Epistemic Semantics of Relational Annotations for Expressive Flow Policies

机译:假设您知道:表达式流量策略的关系注释的认知语义

获取原文

摘要

Many high-level security requirements are about the allowed flow of information in programs, but are difficult to make precise because they involve selective downgrading. Quite a few mutually incompatible and ad-hoc approaches have been proposed for specifying and enforcing downgrading policies. Prior surveys of these approaches have not provided a unifying technical framework. Notions from epistemic logic have emerged as a good approach to policy semantics but are considerably removed from well developed static and dynamic enforcement techniques. We develop a unified framework for expressing, giving meaning and enforcing information downgrading policies that builds on commonly known and widely deployed concepts and techniques, especially static and dynamic assertion checking. These concepts should make information flow accessible and enable developers without special training to specify precise policies. The unified framework allows to directly compare different policy specification styles and enforce them by leveraging existing techniques.
机译:许多高级安全性要求与程序中允许的信息流有关,但由于涉及选择性降级,因此很难精确。已经提出了一些相互不兼容且特别的方法来指定和执行降级策略。对这些方法的先前调查并未提供统一的技术框架。认知逻辑的概念已成为一种处理策略语义的好方法,但已从成熟的静态和动态执行技术中大为删除。我们开发了一个统一的框架,用于表达,给出含义并强制执行信息降级策略,该策略建立在众所周知且广泛部署的概念和技术的基础上,尤其是静态和动态断言检查。这些概念应使信息流易于访问,并使开发人员无需进行特殊培训即可指定精确的策略。统一的框架允许直接比较不同的策略规范样式,并利用现有技术来实施它们。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号