Call for Paper - April 2023 Edition
IJCA solicits original research papers for the April 2023 Edition. Last date of manuscript submission is March 20, 2023. Read More

A new Relational Watermarking Scheme Resilient to Additive Attacks

International Journal of Computer Applications
© 2010 by IJCA Journal
Number 5 - Article 1
Year of Publication: 2010
Prof. R.Manjula

Prof. R.Manjula and Nagarjuna.Settipalli. Article:A new Relational Watermarking Scheme Resilient to Additive Attacks. International Journal of Computer Applications 10(5):1–7, November 2010. Published By Foundation of Computer Science. BibTeX

	author = {Prof. R.Manjula and Nagarjuna.Settipalli},
	title = {Article:A new Relational Watermarking Scheme Resilient to Additive Attacks},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {10},
	number = {5},
	pages = {1--7},
	month = {November},
	note = {Published By Foundation of Computer Science}


Strengthening the ownership rights on outsourced relational database is very important in today’s internet environment. Especially where sensitive, valuable content is to be outsourced. Let us take an example of university database, weather data, stock market data, power consumption consumer behaviour data, and medical and scientific data. The increasing use of databases in applications beyond “behind–the- firewalls data processing” is creating a need for watermarking relational databases. Watermarking for relational data is made possible by fact that real data can very often tolerate a small amount of errors without any significant degradation with respect to their usability. In this paper, we present a mechanism that is resilient or insensitive to additive attacks, how to embed and detect watermark in relational database. In additive attack the attacker simply inserts his/her own watermark in original data. In our proposed system we can draw graphs and original ownership claim can be resolved by locating the overlapping regions of the two watermarks in which the bit values of the marks conflict and determining which owner’s mark win. The attacker must have inserted the watermark later. Clearly having more marked tuples increases collisions and hence we can easily identify the owner of the data.


  • Ajay Goel, ”Improved Digital Watermarking Techniques and Data Embedding In Multimedia.”Department of CSE Singhania University, Rajasthan, Rupesh Gupta Department of Mechanical Engineering, Singhania University Rajasthan, O.P.Sahu Department of ECE, N.I.T. Kurukshetra, Sheifali Gupta Department of ECE Singhania University, Rajasthan, India , 2010.
  • Ali Al-Aaj and Ashrafbdeh, ”Robust and Blind Watermarking of Relational Database Systems.”Princess sumaya University for Technology AI-Jubeiha,Jordan, 2008.
  • Ms. ArtiDeshpande, Mr. JayantGadge, “New Watermarking Technique for Relational Databases.” Department of Computer Engineering, Thadomal Shahani Engineering College, Mumbai, ICETET-2009.
  • Ashraf Odeh and Ali Al-Haj, “Watermarking Relational Database System.” Arab Academy for Financial and Banking Sciences, 2Princess Sumaya University for Technology, Amman, JORDA, 2008.
  • S. Craver, N.Memon, B.-L.Yeo, andM. M. Yeung. “Resolving rightful ownerships with invisible watermarking techniques: Limitations, attacks, and implications. ”IEEE Journal of Selected Areas in Communications, 16(4):573–586, 1998.
  • DarkoKirovski and Fabien A. P. Petitcolas, ”Blind Pattern Matching Attack on Watermarking Systems. ”IEEE Tractions on signal processing, Vol. 51, NO. 4, April 2003.
  • Fabien A.P. Petitcolas, Ross J. Anderson, and Markus G. Kuhn, Fabien A.P. Petitcolas, Ross J. Anderson, and Markus G. Kuhn, “Attacks on Copyright Marking System.”Notes in Computer Science, Portland, Oregon, USA, 14 17 April, 1998.
  • Fernando Perez-Gonzalez and Juan R. Hernandez, ”A Tutorial on Digital Watermarking.” Dept. Tecnologıas de las Comunicaciones, ETSI Telecom., Universidad de Vigo, Spain, 1999.
  • Frank Hartung and Bernd Girod, ”Watermarking of Uncompressed and compressed video.”Telecommunication Institute, University of Erlangen-Nurembery, 1998.
  • Jonathan K. Su, Frank Hartung and Bernd Girod,” Spread Spectrum Watermarking: Malicious Attacks and Counterattacks.” Telecommunication Laboratory, University of Erlangen Nuremberg, Germany, 1999.
  • S.P .Mahanty, “A Tutorial Review Report.” Department of Electrical Engineering, Indian Institute of Sciences, Bangalore, India, 1999.
  • Mohamed Shehab, ArifGhafoor, IEEE, Elisa Bertino, Fellow, “Watermarking Relational Databases Using Optimization-Based Techniques.”IEEE, Vol.20, 2008.
  • Podilchuk, C.I. and Delp., E.J, ”Digital Watermarking: Algorithms and Applications. ”IEEE Signal Processing Magazine, 2001.
  • RaduSion, ”Proving Ownership over Categorical Data. ”Computer Sciences and the Center for Education and Research in Information Assurance and Security, Purdue University, USA, 2004.
  • RakeshAgrawal, Jerry Kiernan, “Watermarking Relational Databases.” IBM Almaden Research Center, china, 2002.
  • R.Sion, M.Atallah, and S.Prabhkar, “Right Protection for Relational Data. ”IEEE Trans. Knowledge and Data Engineering, Vol16 no.6, June 2004.
  • VikasSaxena, J.P.Gupta, ”Collision Attack Resilient Watermarking scheme for Colored Images Using DCT.” IAENG, International journal of Computer Sciences, 2007.
  • Wilfred Ng and Ho-Lam Lau, “Effective Approaches for Watermarking XML Data.”Department of Computer Science, the Hong Kong University of Science and Technology, Hong Kong, 2005.
  • Yanqun Zhang, “Digital Water marking Technology: A Review.”Department of Computer Science and Technology, China University of Mining and Technology,2009.
  • Yingji u Li, Member, IEEE, VipinSwarup, and SushilJajodia, Senior Member, IEEE, “Fingerprinting Relational Databases: Schemes and Specialties.” Vol no.2, March 2005.