Code Reverse Engineering Problem for Identification Codes

DOI10.1109/TIT.2011.2177808MaRDI QIDQ5272022zbMATH OpenOpenAlexFDO

Authors Julien Bringer, Hervé Chabanne

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1105.1601

Mathematics Subject Classification ID

Information theory (general) (94A15) Bounds on codes (94B65)

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.

Recommendations

• On identifying codes
• scientific article; zbMATH DE number 1436153
• scientific article; zbMATH DE number 4101097
• Identifying malicious code through reverse engineering
• Reverse engineering
• Identifying an unknown code by partial Gaussian elimination
• Decipherability of codes
• Codes for strong identification

Cited in

(1)

• Identifying an unknown code by partial Gaussian elimination

This page was built for publication: Code Reverse Engineering Problem for Identification Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272022)