Bounds on the Number of Users for Random 2-Secure Codes

Authors:
Manabu Hagiwara;Takahiro Yoshida;Hideki Imai
Affiliations:
Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan 101-0021 and Center for Research and Development Initiative, Chuo Universit ...;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan 101-0021 and Center for Research and Development Initiative, Chuo Universit ...;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan 101-0021 and Faculty of Science and Engineering, Chuo University, Tokyo, Ja ...
Venue:
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2009

Citing 4
Cited 1

Optimal probabilistic fingerprint codes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
High rate fingerprinting codes and the fingerprinting capacity

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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

Zero false positive 2-secure fingerprinting watermarking based on combining hamming distance conditions and parent pair search

Proceedings of the 12th ACM workshop on Multimedia and security

Quantified Score

Hi-index	0.00

Visualization

Abstract

An illegal re-distribution problem is a problem that a regular user who received content re-distributes without legal permutation. This becomes a social problem all over the world. As it is indicated in [2], this problem has been known since a few or more handred years ago. Boneh and Shaw formalize this problem as collusion-secure fingerprinting (c-secure code) for digital data [2]. After their work, study of c-secure code has become one of popular research stream for information security [1]. One of remarkable results is called Tardos's code [5]. Tardos's code achieved to construct approximately optimal length c-secure codes with random coding method.