Proceedings of the International Conference on Information Systems Design and Intelligent Applications 2012 (INDIA 2012) held in Visakhapatnam, India, January 2012 pp 531-538 | Cite as
A Distortion Free Relational Database Watermarking Using Patch Work Method
Abstract
Database relations are widely used over the Internet. Since these data can be easily tampered with, it is critical to ensure the integrity of these data. In this paper, we propose to make use of fragile watermarks to detect malicious alterations made to a database relation. The proposed scheme is distortion free, unlike other watermarking schemes which inevitably introduce distortions to the cover data. In our algorithm, the watermark is calculated from the linear feedback shift register generating values of the key. Watermarks are embedded and verified in database independently and hence any modifications can be detected.
Keywords
Fragile watermarking linear feedback shift register database security integrityPreview
Unable to display preview. Download preview PDF.
References
- 1.Agrawal, R., Kiernan, J.: Watermark relational databases. In: Proc. of the 28th Inter. Conf.On Very Large Data Bases (2002)Google Scholar
- 2.Li, Y., Swarup, V., Jajodia, S.: A robust watermarking scheme for relational data. In: Proc. of the 13th Workshop on Information Technology and Engineering, pp. 195–200 (December 2003)Google Scholar
- 3.Sion, R., Atallah, M., Prabhakar, S.: Rights protection for relational data. In: Proceedings of ACM SIGMOD 2003 (2003)Google Scholar
- 4.Li, Y., Guo, H., Jajodia, S.: Tamper detection and localization for categorical data using fragile watermarks. In: Proceedings of the 4th ACM Workshop on Digital Rights Management (DRM 2004), pp. 73–82. ACM Press, Washington, DC (2004)CrossRefGoogle Scholar
- 5.Lin, E., Delp, E.: A review of fragile image watermarks. In: Proc. Of the Multimedia and Security Workshop (ACM Multimedia 1999), October 30-November 5 (1999)Google Scholar
- 6.Sion, R.: Proving ownership over categorical data. In: Proceedings of ICDE 2004 (2004)Google Scholar
- 7.Sion, R., Atallah, M., Prabhakar, S.: Rights protection for relational data. In: Proceedings of ACM SIGMOD 2003 (2003)Google Scholar
- 8.Myrvold, Ruskey: Ranking and unranking permutations in linear time. Inf. Process. Lett (2001)Google Scholar
- 9.Bhattacharya, S., Cortesi, A.: A distortion free watermark framework for relational databases. In: Proceedings of the 4th International Conference on Software and Data Technologies (ICSOFT 2009), pp. 229–234. INSTICC Press, Sofia (2009a)Google Scholar
- 10.Li, Y., Deng, R.H.: Publicly verifiable ownership protection for relational databases. In: Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security (ASIACCS 2006), pp. 78–89. ACM Press, Taipei (2006)CrossRefGoogle Scholar
- 11.Tsai, M., Tseng, H., Lai, C.: A database watermarking technique for temper detection. In: Proceedings of the 2006 Joint Conference on Information Sciences (JCIS 2006). Atlantis Press, Kaohsiung (2006)Google Scholar