arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.07559cs.CRcs.LO
收藏

Internet协议TLS的归纳分析

Inductive Analysis of the Internet Protocol TLS

Lawrence C. Paulson

摘要:

互联网浏览器使用安全协议来保护敏感信息。TLS(SSL 3.0的后代)的归纳分析已经使用定理证明器Isabelle进行。证明基于高阶逻辑,不对信念或有限性做任何假设。所有明显的安全目标都可以得到证明;即使旧的会话密钥已经泄露,会话恢复也是安全的。这些证明建议进行一些小的修改以简化分析。TLS,即使在抽象层面上,也比研究人员已经验证的大多数协议复杂得多。会话密钥是协商而不是分发的,并且该协议有许多可选部分。然而,验证TLS所需的资源并不多:六个人工周的工作量和三分钟的处理器时间。

英文摘要:

Internet browsers use security protocols to protect sensitive messages. An inductive analysis of TLS (a descendant of SSL 3.0) has been performed using the theorem prover Isabelle. Proofs are based on higher-order logic and make no assumptions concerning beliefs or finiteness. All the obvious security goals can be proved; session resumption appears to be secure even if old session keys have been compromised. The proofs suggest minor changes to simplify the analysis. TLS, even at an abstract level, is much more complicated than most protocols that researchers have verified. Session keys are negotiated rather than distributed, and the protocol has many optional parts. Nevertheless, the resources needed to verify TLS are modest: six man-weeks of effort and three minutes of processor time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑