Paper 2009/549
Making Collusion-Secure Codes (More) Robust against Bit Erasure
Koji Nuida
Abstract
A collusion-secure code is called robust if it is secure against erasure of a limited number of undetectable bits, in addition to collusion attacks under Marking Assumption. In this article, we propose the first general conversion method of (non-robust)
Note: A preliminary version of this work is to be presented at The 4th International Conference on Information Theoretic Security (ICITS 2009), Shizuoka, Japan, December 3-6, 2009.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- fingerprintingtraitor tracing
- Contact author(s)
- k nuida @ aist go jp
- History
- 2009-11-16: received
- Short URL
- https://ia.cr/2009/549
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/549, author = {Koji Nuida}, title = {Making Collusion-Secure Codes (More) Robust against Bit Erasure}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/549}, year = {2009}, url = {https://eprint.iacr.org/2009/549} }