Fingerprinting long forgiving messages
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Lower bounds for collusion-secure fingerprinting
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Boneh-Shaw Content Fingerprinting
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Error- and Collusion-Secure Fingerprinting for Digital Data
IH '99 Proceedings of the Third International Workshop on Information Hiding
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
Low Bandwidth Dynamic Traitor Tracing Schemes
Journal of Cryptology
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
On the Fingerprinting Capacity Under the Marking Assumption
IEEE Transactions on Information Theory
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
Trace and revoke systems with short ciphertexts
Proceedings of the 2nd international conference on Security of information and networks
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
High-rate random-like spherical fingerprinting codes with linear decoding complexity
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Bandwidth efficient asymmetric fingerprinting based on one-out-of-two oblivious transfer
International Journal of Information and Computer Security
On the security of pseudorandomized information-theoretically secure schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
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
Short collusion-secure fingerprint codes against three pirates
IH'10 Proceedings of the 12th international conference on Information hiding
Tardos's fingerprinting code over AWGN channel
IH'10 Proceedings of the 12th international conference on Information hiding
Query-preserving watermarking of relational databases and Xml documents
ACM Transactions on Database Systems (TODS)
Watermarking for adaptive streaming protocols
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
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
Worst-case optimal fingerprinting codes for non-threshold collusion
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Robust track-and-trace video watermarking
Security and Communication Networks
Message-Based traitor tracing with optimal ciphertext rate
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Bias equalizer for binary probabilistic fingerprinting codes
IH'12 Proceedings of the 14th international conference on Information Hiding
A simple tracing algorithm for binary fingerprinting code under averaging attack
Proceedings of the first ACM workshop on Information hiding and multimedia security
An asymmetric fingerprinting code for collusion-resistant buyer-seller watermarking
Proceedings of the first ACM workshop on Information hiding and multimedia security
Answering n{2+o(1)} counting queries with differential privacy is hard
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We construct binary codes for fingerprinting digital documents. Our codes for n users that are ε-secure against c pirates have length O(c2log(n/ε)). This improves the codes proposed by Boneh and Shaw [1998] whose length is approximately the square of this length. The improvement carries over to works using the Boneh--Shaw code as a primitive, for example, to the dynamic traitor tracing scheme of Tassa [2005]. By proving matching lower bounds we establish that the length of our codes is best within a constant factor for reasonable error probabilities. This lower bound generalizes the bound found independently by Peikert et al. [2003] that applies to a limited class of codes. Our results also imply that randomized fingerprint codes over a binary alphabet are as powerful as over an arbitrary alphabet and the equal strength of two distinct models for fingerprinting.