Soft-Decision Tracing in Fingerprinted Multimedia Content
IEEE MultiMedia
The Lovász Local Lemma and Its Applications to some Combinatorial Arrays
Designs, Codes and Cryptography
A class of I.P.P. codes with efficient identification
Journal of Complexity - Special issue on coding and cryptography
Building efficient and effective multimedia fingerprints via joint coding and embedding
MM&Sec '05 Proceedings of the 7th workshop on Multimedia and security
On generalized separating hash families
Journal of Combinatorial Theory Series A
An Efficient Anonymous Fingerprinting Protocol
Computational Intelligence and Security
New Considerations about the Correct Design of Turbo Fingerprinting Codes
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes
Information Hiding
Equal-Weight Fingerprinting Codes
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Experimental assessment of the reliability for watermarking and fingerprinting schemes
EURASIP Journal on Information Security
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
High-rate random-like spherical fingerprinting codes with linear decoding complexity
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Fingerprinting codes for live pay-television broadcast via internet
MCAM'07 Proceedings of the 2007 international conference on Multimedia content analysis and mining
Journal of Combinatorial Theory Series A
Bandwidth efficient asymmetric fingerprinting based on one-out-of-two oblivious transfer
International Journal of Information and Computer Security
A family of asymptotically good binary fingerprinting codes
IEEE Transactions on Information Theory
A simple fingerprinting scheme for large user groups
Frontiers of Computer Science in China
Digital fingerprinting under and (somewhat) beyond the marking assumption
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Obtaining asymptotic fingerprint codes through a new analysis of the boneh-shaw codes
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Performance study on multimedia fingerprinting employing traceability codes
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Fingerprinting schemes. identifying the guilty sources using side information
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
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
Traitor tracing against powerful attacks using combinatorial designs
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A family of collusion 2-secure codes
IH'05 Proceedings of the 7th international conference on Information Hiding
A practical solution for distribution rights protection in multicast environments
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Near-Optimal collusion-secure fingerprinting codes for efficiently tracing illegal re-distribution
CSS'12 Proceedings of the 4th international conference on Cyberspace Safety and Security
| Hi-index | 754.90 |
We consider a general fingerprinting problem of digital data under which coalitions of users can alter or erase some bits in their copies in order to create an illegal copy. Each user is assigned a fingerprint which is a word in a fingerprinting code of size M (the total number of users) and length n. We present binary fingerprinting codes secure against size-t coalitions which enable the distributor (decoder) to recover at least one of the users from the coalition with probability of error exp(-Ω(n)) for M=exp(Ω(n)). This is an improvement over the best known schemes that provide the error probability no better than exp(-Ω(n12/)) and for this probability support at most exp(O(n12/)) users. The construction complexity of codes is polynomial in n. We also present versions of these constructions that afford identification algorithms of complexity poly(n)=polylog(M), improving over the best previously known complexity of Ω(M). For the case t=2, we construct codes of exponential size with even stronger performance, namely, for which the distributor can either recover both users from the coalition with probability 1-exp(Ω(n)), or identify one traitor with probability 1.