Collusion Secure Fingerprint Watermarking.
Technische Universität Darmstadt, Darmstadt
[Ph.D. Thesis], (2016)
Available under Creative Commons Attribution Non-commercial No-derivatives 3.0 de.
Download (7MB) | Preview
|Item Type:||Ph.D. Thesis|
|Title:||Collusion Secure Fingerprint Watermarking|
Identifying perpetrators via watermarking technology has proven of value in media copyright infringements. To enable tracing back unauthorizedly re-distributed media copies that were manipulated by a collusion attack, collusion secure fingerprinting codes are embedded into the copies via watermarking technology. Fingerprinting codes are mathematical codes designed to resist collusion attacks by means of probabilistically generated codewords and suitable tracing algorithms. However, embedding fingerprinting codes as watermark messages is challenging. This is because of its enormous code length in realistic parameter settings such as small error rates and resistance against large collusions, while the watermarking payload provided by the media copies is very limited. Therefore, to first enable the use of fingerprinting codes in practice, a suitable compromise regarding the fingerprinting parameters must be identified. As the different media fields come with varying requirements on the fingerprinting codes, it is impossible to rely on one specific fingerprinting scheme. Instead, for each of the different media application scenarios separately, the suitable parameter setting is to be identified. With it, conceptuation and design of specifically tailored fingerprinting solutions for the different requirements is first possible. This thesis takes on these challenges to design and optimize various fingerprinting codes each matching a certain application scenario and thereby finally enabling the application of fingerprinting codes for those scenarios in need of collusion security. Hence, we identify a number of application scenarios that are potentially subject to collusion attacks. We give definitions of the different types of fingerprinting schemes, its parameters and properties as well as collusion attacks. The general structure of modern fingerprinting schemes is derived and explained with the example of the Tardos codes. With respect to these definitions, the different application scenarios are analyzed in order to identify the individual requirements. With it we are able to postulate what types of fingerprinting schemes with which parameter settings suffice these requirements. To that effect, various fingerprinting codes are proposed. We developed fingerprinting codes designed to resist very small collusions, while providing shortest code lengths at comparably low error rates. Moreover, different approaches are given, optimizing the generation of the fingerprinting codes with respect to practical applications and appropriate parameter settings. To that, we also developed the corresponding tracing strategies, imposing improvements regarding error rates, code length, complexity and that are independent of the attacks. Besides, we also showed how fingerprinting codes can be realized in hashtable database scenarios thus enabling collusion security also for this scenario. The proposed approaches all have their specific advantages, for which each is the most appropriate for a specific application scenario and use case. This allows to apply fingerprinting codes in practice and provides collusion security for various media scenarios.
|Place of Publication:||Darmstadt|
|Classification DDC:||000 Allgemeines, Informatik, Informationswissenschaft > 000 Allgemeines, Wissenschaft
000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik
|Divisions:||20 Department of Computer Science
20 Department of Computer Science > Algorithmics
20 Department of Computer Science > Security Engineering
|Date Deposited:||18 Jan 2016 16:09|
|Last Modified:||03 Aug 2016 07:44|
|Referees:||Waidner, Prof. Dr. Michael and Grimm, Prof. Dr. Rüdiger and Steinebach, Dr. Martin|