Watermill: An Optimized Fingerprinting System for Databases under Constraints

Abstract

This paper presents a walermarking/fingerprinting system for relational databases. It features a built-in declarative language to specify usability constraints that watermarked data sets must comply with. For a subset of these constraints, namely, weight-independent constraints, we propose a novel watermarking strategy that consists of translating them into an integer linear program. We show two watermarking strategies: an exhaustive one based on integer linear programming constraint solving and a scalable pairing heuristic. Fingerprinting applications, for which several distinct watermarks need to be computed, benefit from the reduced computation time of our method that precomputes the watermarks only once. Moreover, we show that our method enables practical collusion-secure fingerprinting since the precomputed watermarks are based on binary alterations located at exactly the same positions. The paper includes an in-depth analysis of false-hit and false-miss occurrence probabilities for the detection algorithm. Experiments performed on our open source software WATERMILL assess the watermark robustness against common attacks and show that our method outperforms the existing ones concerning the watermark embedding speed.

DOI: 10.1109/TKDE.2007.190713

6 Figures and Tables

Cite this paper

@article{Lafaye2008WatermillAO, title={Watermill: An Optimized Fingerprinting System for Databases under Constraints}, author={Julien Lafaye and David Gross-Amblard and Cam{\'e}lia Constantin and Meryem Guerrouani}, journal={IEEE Transactions on Knowledge and Data Engineering}, year={2008}, volume={20}, pages={532-546} }