Code Reverse Engineering problem for Identification Codes

TL;DR

This paper extends the Code Reverse Engineering problem to identification codes, providing new security proofs and strengthening existing security results through information-theoretic analysis.

Contribution

It introduces an extension of the CRE problem to identification codes and offers a formal security proof using information theory.

Findings

Extended security results for identification codes

Proved security of the protocol with information-theoretic arguments

Strengthened previous security guarantees

Abstract

At ITW'10, Bringer et al. suggest to strengthen their previous identification protocol by extending the Code Reverse Engineering (CRE) problem to identification codes. We first extend security results by Tillich et al. on this very problem. We then prove the security of this protocol using information theoretical arguments.