On playing “Twenty Questions” with a liar
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Playing twenty questions with a procrastinator
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Attacks on Copyright Marking Systems
Proceedings of the Second International Workshop on Information Hiding
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Achievable Performance of Digital Watermarking Systems
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
On the Complexity of Obtaining Optimal Watermarking Schemes
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
A cryptographic method for secure watermark detection
IH'06 Proceedings of the 8th international conference on Information hiding
| Hi-index | 0.00 |
In this paper, we focus on the security aspect of public watermarking schemes. Specifically, given a watermarked sequence I, we consider smart attackers whose task is to find a non-watermarked sequence I驴 using as few calls to the publicly available detection routine as possible. We restrict the media to binary sequences and use Hamming distance as the measure. We study a class of watermarking schemes and give an attacker who uses expected O(d(1 + log(n/k))) calls to find such I驴, where d and k are determined by the false alarm and distortion of the scheme, and n is the length of the sequence. This attacker is optimal when k = o(n). By taking the number of calls required as a measure of the security, we can trade-off the requirements on security, false alarm and distortion.