Welcome to the resource topic for 2006/064
Title:
Perturbing and Protecting a Traceable Block Cipher
Authors: Julien Bringer, Hervé Chabanne, Emmanuelle Dottax
Abstract:At the Asiacrypt 2003 conference Billet and Gilbert introduce a block cipher, which, to quote them, has the following paradoxical traceability properties: it is computationally easy to derive many equivalent distinct descriptions of the same instance of the block cipher; but it is computationally difficult, given one or even up to k of them, to recover the so-called meta-key from which they were derived, or to find any additional equivalent description, or more generally to forge any new untraceable description of the same instance of the block cipher.
Their construction relies on the Isomorphism of Polynomials (IP) problem. We here show how to strengthen this construction against algebraic attacks by concealing the underlying IP problems.
Our modification is such that our description of the block cipher now does not give the expected results all the time and parallel executions are used to obtain the correct value.
ePrint: https://eprint.iacr.org/2006/064
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .