A short random fingerprinting code against a small number of pirates

Authors:
Manabu Hagiwara;Goichiro Hanaoka;Hideki Imai
Affiliations:
Research Center for Information Security (RCIS), Advanced Industrial Science and Technology (AIST), Tokyo, Japan;Research Center for Information Security (RCIS), Advanced Industrial Science and Technology (AIST), Tokyo, Japan;Research Center for Information Security (RCIS), Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Venue:
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2006

Citing 4
Cited 6

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
Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory
Digital fingerprinting codes: problem statements, constructions, identification of traitors

IEEE Transactions on Information Theory

An improvement of discrete Tardos fingerprinting codes

Designs, Codes and Cryptography
Bounds on the Number of Users for Random 2-Secure Codes

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An Error-Tolerant Variant of a Short 2-Secure Fingerprint Code and Its Security Evaluation

IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Optimization of Tardos's fingerprinting codes in a viewpoint of memory amount

IH'07 Proceedings of the 9th international conference on Information hiding
An improvement of pseudorandomization against unbounded attack algorithms: the case of fingerprint codes

ICITS'09 Proceedings of the 4th international conference on Information theoretic security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a variant of Tardos code which is practical for various applications against a small number of pirates. As an example of our results, for c=5, the code length becomes only 1500 log(1/ε) bits while the conventional Tardos code requires 2500 log(1/ε) bits, where ε is a security parameter. Furthermore our codes do not need a continuous distribution which is needed to construct the original Tardos codes. Our codes are based on a simple random variable drawn from a small set. It implies that it makes to implement and to perform a simulation extremely easier than the original one.