Referenced Items are not available for this document.
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.
Published in:
Information Theory, IEEE Transactions on
(Volume:58
,
Issue:
4
)
Date of Publication: April 2012
- Page(s):
- 2406 - 2412
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 12592392
- Digital Object Identifier :
- 10.1109/TIT.2011.2177808
- Product Type:
- Journals & Magazines
- Date of Publication :
- 09 January 2012
- Date of Current Version :
- 15 March 2012
- Issue Date :
- April 2012
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
