Experimental assessment of the reliability for watermarking and fingerprinting schemes

Authors:
Frédéric Cérou;Teddy Furon;Arnaud Guyader
Affiliations:
TraitemEnt, Modélisation d'Images & CommunicationS, Institut Rennes, Bretagne Atlantique Research Center, Rennes Cedex, France;TraitemEnt, Modélisation d'Images & CommunicationS, Institut Rennes, Bretagne Atlantique Research Center, Rennes Cedex, France;TraitemEnt, Modélisation d'Images & CommunicationS, Institut Rennes, Bretagne Atlantique Research Center, Rennes Cedex, France
Venue:
EURASIP Journal on Information Security
Year:
2008

Citing 9
Cited 1

Computing the Probability of False Watermark Detection

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
Optimal detector for multiplicative watermarks embedded in the DFT domain of non-white signals

EURASIP Journal on Applied Signal Processing
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes

Designs, Codes and Cryptography
An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Performance analysis of existing and new methods for data hiding with known-host information in additive channels

IEEE Transactions on Signal Processing
Digital fingerprinting codes: problem statements, constructions, identification of traitors

IEEE Transactions on Information Theory
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources

IEEE Transactions on Information Theory
Tardos Fingerprinting is Better Than We Thought

IEEE Transactions on Information Theory

Towards joint tardos decoding: the 'don quixote' algorithm

IH'11 Proceedings of the 13th international conference on Information hiding

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concept of reliability in watermarking as the ability of assessing that a probability of false alarm is very low and below a given significance level. We propose an iterative and self-adapting algorithm which estimates very low probabilities of error. It performs much quicker and more accurately than a classical Monte Carlo estimator. The article finishes with applications to zero-bit watermarking (probability of false alarm, error exponent), and to probabilistic fingerprinting codes (probability of wrongly accusing a given user, code length estimation).