Adaptive Security of Symbolic Encryption
Adaptive Security of Symbolic Encryption
复制标题
符号加密的自适应安全性
DOI：
10.1007/978-3-540-30576-7_10
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
S. Panjwani
中科院分区：
文献类型：
--
作者：
Daniele Micciancio;S. Panjwani
我们证明了一个计算可靠性定理的符号分析的密码协议，扩展了一个类似的定理阿巴迪和Rogaway（J.密码学15（2）：103-127，2002）的情况下，对手得到看到的加密序列的自适应选择的符号表达式。阿巴迪和罗加维定理对这种自适应场景的扩展是不平凡的，并提出了与选择性解除的经典问题相关的问题，这些问题在该定理的原始公式中没有出现。虽然阿巴迪和罗加维定理仅适用于被动对手，但我们对自适应攻击的扩展使其更强大，并且功能强大，足以分析实际感兴趣的密码协议的安全性。我们使用我们的稳健性定理在分析组密钥分发协议，如那些出现在组播和广播应用程序。具体来说，我们提供了加密定义的安全组播密钥分发协议的符号以及计算框架，并使用我们的定理来证明的符号定义的合理性。
We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology 15(2):103–127, 2002) to a scenario where the adversary gets to see the encryption of a sequence of adaptively chosen symbolic expressions. The extension of the theorem of Abadi and Rogaway to such an adaptive scenario is nontrivial, and raises issues related to the classic problem of selective decommitment, which do not appear in the original formulation of the theorem.Although the theorem of Abadi and Rogaway applies only to passive adversaries, our extension to adaptive attacks makes it substantially stronger, and powerful enough to analyze the security of cryptographic protocols of practical interest. We exemplify the use of our soundness theorem in the analysis of group key distribution protocols like those that arise in multicast and broadcast applications. Specifically, we provide cryptographic definitions of security for multicast key distribution protocols both in the symbolic as well as the computational framework and use our theorem to prove soundness of the symbolic definition.