Introduction to Algorithms
A 2-Secure Code with Efficient Tracing Algorithm
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Error- and Collusion-Secure Fingerprinting for Digital Data
IH '99 Proceedings of the Third International Workshop on Information Hiding
Collusion Secure q-ary Fingerprinting for Perceptual Content
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Fingerprinting Concatenated Codes with Efficient Identification
ISC '02 Proceedings of the 5th International Conference on Information Security
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
Efficient Traitor Tracing from Collusion Secure Codes
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Traitor tracing with constant size ciphertext
Proceedings of the 15th ACM conference on Computer and communications security
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
Two-level fingerprinting codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
A family of collusion 2-secure codes
IH'05 Proceedings of the 7th international conference on Information Hiding
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Robust fingerprinting codes: a near optimal construction
Proceedings of the tenth annual ACM workshop on Digital rights management
Bias equalizer for binary probabilistic fingerprinting codes
IH'12 Proceedings of the 14th international conference on Information Hiding
| Hi-index | 0.00 |
A c-secure fingerprint code is called robust if it is secure against a limited number of bit erasure in undetectable positions in addition to usual collusion attacks. In this article, we propose the first general conversion method of (non-robust) c-secure codes to robust c-secure codes. It is also applicable to amplify robustness of given robust c-secure codes. By applying our conversion to c-secure codes given by Nuida et al. (AAECC 2007), we present robust c-secure codes with code lengths of order Θ(c2 log2 c) with respect to c. The code length improves preceding results by Sirvent (WCC 2007) and by Boneh and Naor (ACM CCS 2008) and is close to the one by Billet and Phan (ICITS 2008), where our result is based on a weaker assumption than those preceding results. As an application, the use of the resulting code in construction by Boneh and Naor also improves their traitor tracing scheme against imperfect decoders in efficiency of key sizes and pirate tracing procedure.