Computational indistinguishability logic

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).

• Type: Conference
• Year: 2010
• Where: CCS
• Authors: Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech
• Keywords: CCS 2010, Computational Indistinguishability Logic, Probabilistic Signature Scheme, Reasoning, Security Privacy