DocumentCode
1417481
Title
Code Reverse Engineering Problem for Identification Codes
Author
Bringer, Julien ; Chabanne, Hervé
Author_Institution
Morpho, Issy-les-Moulineaux, France
Volume
58
Issue
4
fYear
2012
fDate
4/1/2012 12:00:00 AM
Firstpage
2406
Lastpage
2412
Abstract
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.
Keywords
Reed-Solomon codes; cryptographic protocols; identification; reverse engineering; telecommunication security; CRE problem; code reverse engineering problem; computational assumptions; identification codes; identification protocol security; information theoretical arguments; Decoding; Encoding; Error analysis; Polynomials; Protocols; Reed-Solomon codes; Security; Code Reverse Engineering (CRE); Reed-Solomon; identification codes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2011.2177808
Filename
6126033
Link To Document