Computational soundness of indistinguishability properties without computable parsing
Computational soundness of indistinguishability properties without computable parsing
复制标题
无需可计算解析的不可区分属性的计算可靠性
DOI：
10.1007/978-3-642-29101-2_5
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
and Hideki Sakurada
中科院分区：
文献类型：
--
作者：
Hubert Comon-Lundh;Masami Hagiya;Yusuke Kawamoto;and Hideki Sakurada
我们提供了一个使用公钥加密和哈希函数的协议的符号模型，并证明了这个模型是计算上的声音：如果有一个在计算世界中的攻击，那么有一个攻击的符号（抽象）模型。我们最初的贡献是，我们处理的安全属性，如匿名性，这不能用一个单一的执行跟踪描述，同时考虑一个无限数量的会话的协议中存在的主动和自适应的对手。我们的合理性证明是不同于所有现有的研究，因为它不需要一个可计算的解析功能，从位串的条款。这使我们能够处理更多的加密原语，例如输入可能具有不同长度的抗原像和抗冲突哈希函数。
We provide a symbolic model for protocols using public-key encryption and hash function, and prove that this model is computationally sound: if there is an attack in the computational world, then there is an attack in the symbolic (abstract) model. Our original contribution is that we deal with the security properties, such as anonymity, which cannot be described using a single execution trace, while considering an unbounded number of sessions of the protocols in the presence of active and adaptive adversaries. Our soundness proof is different from all existing studies in that it does not require a computable parsing function from bit strings to terms. This allows us to deal with more cryptographic primitives, such as a preimage-resistant and collision-resistant hash function whose input may have different lengths.