Abstract.
We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking, and delineate desirable properties of a watermarking system for relational data. We then present an effective watermarking technique geared for relational data. This technique ensures that some bit positions of some of the attributes of some of the tuples contain specific values. The specific bit locations and values are algorithmically determined under the control of a secret key known only to the owner of the data. This bit pattern constitutes the watermark. Only if one has access to the secret key can the watermark be detected with high probability. Detecting the watermark requires access neither to the original data nor the watermark, and the watermark can be easily and efficiently maintained in the presence of insertions, updates, and deletions. Our analysis shows that the proposed technique is robust against various forms of malicious attacks as well as benign updates to the data. Using an implementation running on DB2, we also show that the algorithms perform well enough to be used in real-world applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
1. Atallah M, Wagstaff S (1999) Watermarking with quadratic residues. In: Proceedings of IS&T/SPIE conference on security and watermarking of multimedia contents, San Jose, CA, USA, January 1999
2. Bender W, Gruhl D, Morimoto N (1995) Techniques for data hiding. In: Proceedings of the SPIE 2420 (storage and retrieval for image and video databases III), San Jose, CA, USA, February 1995, pp 164--173
3. Boney L, Tewfik AH, Hamdy KN (1996) Digital watermarks for audio signals. In: Proceedings of the international conference on multimedia computing and systems, Hiroshima, June 1996
4. Collberg CS, Thomborson C (2000) Watermarking, tamper-proofing, and obfuscation -- tools for software protection. Technical report 2000--03, University of Arizona
5. Cox IJ, Miller ML (1997) A review of watermarking and the importance of perceptual modeling. In: Proceedings of SPIE (Human Vision and Electronic Imaging II, San Jose, CA, USA, February 1997
6. Cramér H (1946) Mathematical methods of statistics. Princeton University Press, Princeton, NJ
7. Craver S, Memon N, Yeo BL, Yeung MM (1998) Resolving rightful ownerships with invisible watermarking techniques: Limitations, attacks, and implications. IEEE J Selected Areas Commun 16(4):573--586
8. Dugelay JL, Roche S (2000) A survey of current watermarking techniques. In: Katzenbeisser S, Petitcolas FA (eds) Information hiding techniques for steganography and digital watermarking. Artech House, Norwood, MA, pp 121--148
9. Hartung F, Girod B (1998) Watermarking of uncompressed and compressed video. Signal Process 66(3):283--301
10. Johnson NF, Duric Z, Jajodia S (2000) Information hiding: steganography and watermarking -- attacks and countermeasures. Kluwer, Amsterdam
11. Ó Ruanaidh JJK, Dowling WJ, Boland FM (1996) Watermarking digital images for copyright protection. IEEE Proc Vision Signal Image Process 143(4):250--256
12. Katzenbeisser S, Petitcolas FA (eds) Information hiding techniques for steganography and digital watermarking. Artech House, Norwood, MA
13. Kerckhoffs A (1883) La cryptographie militaire. J Sci Militaires 9:5--38
14. Knuth D (1981) Seminumerical algorithms. In: The art of computer programming, vol 2. Addison-Wesley, Reading, MA
15. Law A, Kelton W (2000) Simulation modeling and analysis, 3rd edn. McGraw-Hill, New York
16. Maes M (1998) Twin peaks: the histogram attack on fixed depth image watermarks. In: Proceedings of the 2nd international workshop on information hiding, Lecture notes in computer science, vol 1525. Springer, Berlin Heidelberg New York, pp 290--305
17. Maxemchuk N (1994) Electronic document distribution. Technical journal, AT&T Labs
18. Schneier B (1996) Applied cryptography, 2nd edn. Wiley, New York
19. Wagner NR (1983) Fingerprinting. In: Proceedings of the IEEE symposium on security and privacy, Oakland, CA, April 1983, pp 18--22
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 29 July 2002, Accepted: 10 December 2002, Published online: 10 July 2003
Edited by P. Bernstein
A preliminary version of this paper appeared in the Proceedings of the 28th VLDB Conference, Hong Kong, China, 2002.
Rights and permissions
About this article
Cite this article
Agrawal, R., Haas, P.J. & Kiernan, J. Watermarking relational data: framework, algorithms and analysis. VLDB 12, 157–169 (2003). https://doi.org/10.1007/s00778-003-0097-x
Issue Date:
DOI: https://doi.org/10.1007/s00778-003-0097-x