The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2008 vol.20)
pp: 532-546
his paper presents a watermarking/fingerprinting system for relational databases. It features a built-in declarative language to specify usability constraints that watermarked datasets must comply with. For a subset of these constraints, namely weight-independent constraints, we propose a novel watermarking strategy which 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 hits and false misses 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.
Security and Privacy Protection, optimization, database watermarking, database fingerprinting
Julien Lafaye, David Gross-Amblard, Camelia Constantin, Meryem Guerrouani, "Watermill: An Optimized Fingerprinting System for Databases under Constraints", IEEE Transactions on Knowledge & Data Engineering, vol.20, no. 4, pp. 532-546, April 2008, doi:10.1109/TKDE.2007.190713
[1] Eumetsat, http:/, 2007.
[2] R. Agrawal, P.J. Haas, and J. Kiernan, “Watermarking Relational Data: Framework, Algorithms and Analysis,” VLDB J., vol. 12, no. 2, pp. 157-169, 2003.
[3] D. Boneh and J. Shaw, “Collusion-Secure Fingerprinting for Digital Data,” IEEE Trans. Information Theory, vol. 44, no. 5, pp.1897-1905, Sept. 1998.
[4] P. Buneman, S. Khanna, and W.C. Tan, “Why and Where: A Characterization of Data Provenance,” Proc. Eighth Int'l Conf. Database Theory (ICDT '01), vol. 1973, pp. 316-330, 2001.
[5] I.J. Cox, M.L. Miller, and J.A. Bloom, Digital Watermarking. Morgan Kaufmann, 2001.
[6] M. Davide, C. Henning, H. Mohand-Said, A. Troels, and L.H. Legind, “Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins,” Proc. Sixth Int'l Conf. Flexible Query Answering Systems (FQAS '04), pp. 348-361, 2004.
[7] W. Fan and J. Siméon, “Integrity Constraints for XML,” Proc. 19th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS '00), pp. 23-34, 2000.
[8] D. Gross-Amblard, “Query-Preserving Watermarking of Relational Databases and XML Documents,” Proc. 22nd SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS '03), pp. 191-201, 2003.
[9] H.-J. Guth and B. Pfitzmann, “Error- and Collusion-Secure Fingerprinting for Digital Data,” Proc. Third Int'l Workshop Information Hiding (IH '99), pp. 134-145, 2000.
[10] S. Hettich and S. Bay, The UCI KDD Archive, http:/kdd.ics., 1999.
[11] W. Hoeffding, “, Probability Inequalities for Sums of Bounded Random Variables,” J. Am. Statistical Assoc., vol. 58, no. 301, pp.13-30, Mar. 1963.
[12] S. Katzenbeisser and F.A. Petitcolas, Information Hiding, Techniques for Steganography and Digital Watermarking. Artech House, 2000.
[13] J. Lafaye, “WATERMILL: Protecting Ownership Rights of Sales Statistics Databases through Watermarking (DEMO),” Proc. Bases de Données Avancées (BDA '06), 2006.
[14] J. Lafaye, D. Gross-Amblard, C. Constantin, M. Guerrouani, and J. Béguec, “WATERMILL: An Optimized Fingerprinting System for Databases,” http:/, 2007.
[15] Y. Li, V. Swarup, and S. Jajodia, “Constructing a Virtual Primary Key for Fingerprinting Relational Data,” Proc. Third ACM Workshop Digital Rights Management (DRM '03), pp. 133-141, 2003.
[16] Y. Li, V. Swarup, and S. Jajodia, “A Robust Watermarking Scheme for Relational Data,” Proc. 13th Workshop Information Technology and Systems (WITS '03), pp. 195-200, Dec. 2003.
[17] Y. Li, V. Swarup, and S. Jajodia, “Fingerprinting Relational Databases: Schemes and Specialties,” IEEE Trans. Dependable and Secure Computing, vol. 2, no. 1, pp. 34-45, Jan.-Mar. 2005.
[18] H.G. Schaathun, “The Boneh-Shaw Fingerprinting Scheme Is Better than We Thought,” IEEE Trans. Information Forensics and Security, vol. 1, no. 2, pp. 248-255, June 2006.
[19] A. Schrijver, Theory of Linear and Integer Programming. John Wiley & Sons, Apr. 1998.
[20] M. Shehab, E. Bertino, and A. Ghafoor, “Watermarking Relational Databases Using Optimization Based Techniques,” Technical Report 41, CERIAS, 2006.
[21] R. Sion, M. Atallah, and S. Prabhakar, “Rights Protection for Relational Data,” Proc. ACM SIGMOD '03, pp. 98-109, 2003.
[22] R. Sion, M.J. Atallah, and S. Prabhakar, “Rights Protection for Relational Data,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 12, pp. 1509-1525, Dec. 2004.
[23] G. Tardos, “Optimal Probabilistic Fingerprint Codes,” Proc. 35th Ann. ACM Symp. Theory of Computing (STOC '03), pp. 116-125, 2003.
[24] J.D. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, Inc., 1988.
[25] N.R. Wagner, “Fingerprinting,” Proc. IEEE Symp. Security and Privacy, pp. 18-22, 1983.
[26] L.A. Wosley, Integer Programming, first ed. Sept. 1998.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool