A Linear time algorithm for deciding security
A Linear time algorithm for deciding security
复制标题
一种用于决定安全性的线性时间算法
DOI：
--
复制
发表时间：
1976
期刊：
影响因子：
--
通讯作者：
L. Snyder
中科院分区：
文献类型：
--
作者：
Anita K. Jones;R. Lipton;L. Snyder
《Follow》充满了“安全”保护系统在几个小时内被破坏的故事。这是相当令人震惊的，因为一个人不太可能声称一个系统是安全的，而没有某种证据来支持这种说法。在实践中，没有提供证据，原因很清楚：虽然保护原语看起来很简单，但它们可能以极其复杂的方式相互作用。因此，模糊和非正式的论点往往忽略了对手可以利用的微妙之处。精确性不仅是保护系统所需要的，而且是强制性的。
The Folklore is replete with stories of "secure" protection systems being compromised in a matter of hours. This is quite astounding since one is not likely to claim that a system is secure without some sort of proof to support the claim. In practice, proof is not provided and one reason for this is clear: although the protection primitives are apparently quite simple, they may potentially interact in extremely complex ways. Vague and informal arguments, therefore, often overlook subtleties that an adversary can exploit. Precision is not merely desirable for protection systems, it is mandatory.