Computational Soundness, Co-induction, and Encryption Cycles

12 years 6 months ago
Computational Soundness, Co-induction, and Encryption Cycles
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic expressions. Our main finding is that the use of co-induction in the symbolic definition of the adversarial knowledge allows to prove unconditional soundness results, that do not require syntactic restrictions, like the absence of encryption cycles. Encryption cycles are relevant only to the extent that the key recovery function associated to acyclic expressions can be shown to have a unique fix-point. So, when a cryptographic expression has no encryption cycles, the inductive (least fix-point) and co-inductive (greatest fix-point) security definitions produce the same results, and the computational soundness of the inductive definitions for acyclic expressions follows as a special case of the soundness of the co-inductive definition.
Daniele Micciancio
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Authors Daniele Micciancio
Comments (0)