首页> 外文会议>IEEE International Conference on Distributed Computing Systems >MITOS: Optimal Decisioning for the Indirect Flow Propagation Dilemma in Dynamic Information Flow Tracking Systems
【24h】

MITOS: Optimal Decisioning for the Indirect Flow Propagation Dilemma in Dynamic Information Flow Tracking Systems

机译:Mitos:动态信息流跟踪系统中间接流传困境的最佳决策

获取原文

摘要

Dynamic Information Flow Tracking (DIFT), also called Dynamic Taint Analysis (DTA), is a technique for tracking the information as it flows through a program’s execution. Specifically, some inputs or data get tainted and then these taint marks (tags) propagate usually at the instruction-level. While DIFT has been a fundamental concept in computer and network security for the past decade, it still faces open challenges that impede its widespread application in practice; one of them being the indirect flow propagation dilemma: should the tags involved in an indirect flow, e.g., in a control or address dependency, be propagated? Propagating all these tags, as is done for direct flows, leads to overtainting (all taintable objects become tainted), while not propagating them leads to undertainting (information flow becomes incomplete). In this paper, we analytically model that decisioning problem for indirect flows, by considering various tradeoffs including undertainting versus overtainting, importance of heterogeneous code semantics and context. Towards tackling this problem, we design MITOS, a distributed-optimization algorithm, that: decides about the propagation of indirect flows by properly weighting all these tradeoffs, is of low-complexity, is scalable, is able to flexibly adapt to different application scenarios and security needs of large distributed systems. Additionally, MITOS is applicable to most DIFT systems that consider an arbitrary number of tag types, and introduces the key properties of fairness and tag-balancing to the DIFT field. To demonstrate MITOS’s applicability in practice, we implement and evaluate MITOS on top of an open-source DIFT, and we shed light on the open problem. We also perform a case-study scenario with a real in-memory only attack and show that MITOS improves simultaneously (i) system’s spatiotemporal overhead (up to 40%), and (ii) system’s fingerprint on suspected bytes (up to 167%) compared to traditional DIFT, even though these metrics usually conflict.
机译:动态信息流跟踪(DIFT),也称为动态Taint分析(DTA),是一种用于跟踪信息流过程序的执行的技术。具体而言,一些输入或数据得到污染,然后这些污点标记(标签)通常在指令级别传播。虽然Dift在过去十年中是计算机和网络安全的基本概念,但它仍然面临开放的挑战,妨碍其在实践中普遍存在;其中一个是间接流传困境:如果在间接流程中涉及的标签,例如在控制或地址依赖关系中,将传播?传播所有这些标签,如用于直接流动的那样,导致唤醒(所有受污染物体变得污染),同时不会传播它们导致进行开展(信息流变得不完整)。在本文中,我们通过考虑在包括进行与泛滥的方面的各种权衡,异构准则语义和背景的重要性,分析了间接流动决策问题的模型模型。为了解决这个问题,我们设计Mitos,分布式优化算法,即:通过适当加权所有这些权衡来决定间接流动的传播,具有低复杂性,是可扩展的,可以灵活地适应不同的应用场景和大分布式系统的安全性需求。此外,Mitos适用于大多数考虑任意数量的标签类型的DIFT系统,并引入了对DIFT字段的公平性和标签的关键属性。为了在实践中展示Mitos的适用性,我们在开源差异的顶部实施和评估Mitos,并且我们阐明了开放问题。我们还表现出一个实际内存的案例研究场景,只有攻击实际攻击,并显示MITOS同时改善(i)系统的时空开销(高达40%),(ii)系统在疑似字节上的指纹(高达167%)与传统的差异相比,即使这些指标通常发生冲突。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号