Code Reverse Engineering Problem for Identification Codes

At ITW'10, Bringer 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 pro...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2012-04, Vol.58 (4), p.2406-2412
Hauptverfasser:	Bringer, J., Chabanne, H.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Code Reverse Engineering (CRE) Codes Decoding Encoding Error analysis Exact sciences and technology identification codes Information theory Information, signal and communications theory Polynomials Protocol Protocols Reed-Solomon Reed-Solomon codes Security Telecommunications and information theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	At ITW'10, Bringer 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 on this very problem. This enables us to prove the security of this protocol using information theoretical arguments.
ISSN:	0018-9448 1557-9654
DOI:	10.1109/TIT.2011.2177808