Code Reverse Engineering Problem for Identification Codes
At ITW'10, Bringer et al. suggested to strengthen their previous identification protocol where the security depends on computational assumptions (related to the Polynomial Reconstruction problem) by extending the Code Reverse Engineering (CRE) problem to identification codes. We formalize this new problem and we extend security results by Tillich et al. on this very problem. This enables us to prove the security of this protocol using information theoretical arguments.
identification codes code reverse engineering (cre) reed-solomon