9 February 2012 Ranking search for probabilistic fingerprinting codes
Author Affiliations +
Abstract
Digital transaction watermarking today is a widely accepted mechanism to discourage illegal distribution of multimedia. The transaction watermark is a user-specific message that is embedded in all copies of one content and thus makes it individual. Therewith it allows to trace back copyright infringements. One major threat on transaction watermarking are collusion attacks. Here, multiple individualized copies of the work are compared and/or combined to attack the integrity or availability of the embedded watermark message. One solution to counter such attacks are mathematical codes called collusion secure fingerprinting codes. Problems arise when applying such codes to multimedia files with small payload, e.g. short audio tracks or images. Therefore the code length has to be shortened which increases the error rates and/or the effort of the tracing algorithm. In this work we propose an approach whether to use as an addition to probabilistic fingerprinting codes for a reduction of the effort and increment of security, as well as a new separate method providing shorter codes at a very fast and high accurate tracing algorithm.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Marcel Schäfer, Waldemar Berchtold, Martin Steinebach, "Ranking search for probabilistic fingerprinting codes", Proc. SPIE 8303, Media Watermarking, Security, and Forensics 2012, 830306 (9 February 2012); doi: 10.1117/12.908352; https://doi.org/10.1117/12.908352
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

The first BOWS contest (Break Our Watermarking System)
Proceedings of SPIE (February 27 2007)
Co-occurrence steganalysis in high dimensions
Proceedings of SPIE (February 09 2012)
Capacity-optimized mp2 audio watermarking
Proceedings of SPIE (June 20 2003)
Forensic audio watermark detection
Proceedings of SPIE (February 13 2012)
Embedding considering dependencies between pixels
Proceedings of SPIE (March 18 2008)

Back to Top