On the upper bound of the size of the r-cover-free families
Journal of Combinatorial Theory Series A
On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
SIAM Journal on Discrete Mathematics
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An upper bound on the size of a code with the k-identifiable parent property
Journal of Combinatorial Theory Series A
High rate fingerprinting codes and the fingerprinting capacity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
On the Fingerprinting Capacity Under the Marking Assumption
IEEE Transactions on Information Theory
Tardos Fingerprinting is Better Than We Thought
IEEE Transactions on Information Theory
Digital fingerprinting under and (somewhat) beyond the marking assumption
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
| Hi-index | 0.00 |
We consider binary fingerprinting codes that trace at least one of t pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new efficient decoding algorithm. The design substantially increases the code rates of the former fingerprinting constructions. In particular, for large t , the new t -fingerprinting codes have code rate of t *** 2ln 2 and identify a pirate with an error probability that declines exponentially in code length n .