Optimization of Tardos's fingerprinting codes in a viewpoint of memory amount

Authors:
Koji Nuida;Manabu Hagiwara;Hajime Watanabe;Hideki Imai
Affiliations:
Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan and Chuo University, Tokyo, Japan
Venue:
IH'07 Proceedings of the 9th international conference on Information hiding
Year:
2007

Citing 3
Cited 10

Optimal probabilistic fingerprint codes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A short random fingerprinting code against a small number of pirates

AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory

An improvement of discrete Tardos fingerprinting codes

Designs, Codes and Cryptography
Performance study and improvement on ECC-based binary anti-collusion forensic code for multimedia

Proceedings of the 11th ACM workshop on Multimedia and security
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
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
Experimental assessment of probabilistic fingerprinting codes over AWGN channel

IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Capacity of collusion secure fingerprinting: a tradeoff between rate and efficiency

IH'10 Proceedings of the 12th international conference on Information hiding
A new soft decision tracing algorithm for binary fingerprinting codes

IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Bias equalizer for binary probabilistic fingerprinting codes

IH'12 Proceedings of the 14th international conference on Information Hiding
Discrete distributions in the tardos scheme, revisited

Proceedings of the first ACM workshop on Information hiding and multimedia security

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that Tardos's collusion-secure probabilistic fingerprinting code (Tardos code) has length of theoretically minimal order. However, Tardos code uses certain continuous probability distribution, which causes that huge amount of extra memory is required in a practical use. An essential solution is to replace the continuous distributions with finite discrete ones, preserving the security. In this paper, we determine the optimal finite distribution for the purpose of reducing memory amount; the required extra memory is reduced to less than 1/32 of the original in some practical setting. Moreover, the code length is also reduced (to, asymptotically, about 20.6% of Tardos code), and some further practical problems such as approximation errors are also considered.