Computational indistinguishability logic

Computational indistinguishability logic
复制标题

计算不可区分性逻辑

DOI：
--
复制
发表时间：
2010
期刊：
Conference on Computer and Communications Security
影响因子：
--
通讯作者：
Y. Lakhnech
Y. Lakhnech
中科院分区：
--
文献类型：
--
作者：
G. Barthe;M. Daubignard;B. M. Kapron;Y. Lakhnech

文献摘要

被引文献

相似文献

计算不可区分性逻辑（CIL）是计算模型中有关加密原语的推理的逻辑。它捕获了在可证明的安全性中常见的推理模式，例如模拟和减少。 CIL是标准模型的声音，但也支持随机Oracle和其他理想化模型中的推理。 我们通过正式证明概率签名计划（PSS）的安全性来说明CIL的好处。
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in provable security, such as simulations and reductions. CIL is sound for the standard model, but also supports reasoning in the random oracle and other idealized models. We illustrate the benefits of CIL by formally proving the security of the probabilistic signature scheme (PSS).