← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 966.n.1

攻击树从成功攻击倒推

理解等级:高级

攻击树以成功破坏机密性、完整性或可用性为根,逐级分解能够直接造成它的条件,叶子形成可检验攻击刺激。这样把笼统“系统要安全”变成检测和抵抗路径;结构与故障树相似,但要面对有意适应防线的攻击者,不能只沿随机失效概率思考。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 信息安全 · 查看原书依据

      The root of the tree is a successful attack, and the nodes are possible direct causes of that successful attack. Children nodes decompose the direct causes, and so forth. An attack is an attempt to compromise CIA, with the leaves of attack trees being the stimulus in the scenario.

    参考来源

    - 位置:《Software Architecture in Practice, 4th Edition》第11章《信息安全》(来源项目:book-sources;源文件:extracted/Software Architecture in Practice, 4th Edition/_epub-src/ch11.html) - 结论依据:所引连续原文给出本卡机制或取舍;条件与示例结合本节已读上下文解释。 - 原始内容:The root of the tree is a successful attack, and the nodes are possible direct causes of that successful attack. Children nodes decompose the direct causes, and so forth. An attack is an attempt to compromise CIA, with the leaves of attack trees being the stimulus in the scenario.