Computational indistinguishability logic

Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech · 2010

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.

Read the paper · More papers on PaperTik