Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An improved e-mail security protocol
ACSAC '97 Proceedings of the 13th Annual Computer Security Applications Conference
Proving Ownership over Categorical Data
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Publicly verifiable ownership protection for relational databases
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Watermarking relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
Improved versions of Tardos' fingerprinting scheme
Designs, Codes and Cryptography
High rate fingerprinting codes and the fingerprinting capacity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Saddle-point solution of the fingerprinting capacity game under the marking assumption
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Information-theoretic analysis of information hiding
IEEE Transactions on Information Theory
Rebound on Symmetric Tardos Codes
IIH-MSP '12 Proceedings of the 2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Hi-index | 0.00 |
This work presents a new approach for hash database individualization by blending pre-calculated dummy hashes for each user to their databases. This individualization is necessary to detect a leak after the distribution of for example Whitelists or Blacklists. The proposed code is based on collusion secure fingerprinting codes and provides resistance against intuitive attacks for databases as well as attacks for which users collaborate. Both, code generation and tracing requires minimal effort and the distributor is able to control the robustness desired. Advantages compared to salting are improved effort and leakage detection without access to the hash database. A combination of salting and the proposed approach is possible.