Skip to main content

Advertisement

Springer Nature Link
Log in

A Graded Reversible Watermarking Scheme for Relational Data

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Reversible watermarking is an important method of information hiding, which has been widely used in copyright protection of relational data. Reversible watermarking is more advanced than its predecessors in many ways. It can be used not only to claim copyright but also to recover the original data. However, existing schemes do not allow control of the extent of data recovery. Watermarked data are either completely restored to the original version or kept unchanged. After analyzing the current problems, a graded reversible watermarking scheme for relational data is proposed here. By removing the arbitrary portion of the watermark, data quality can be enhanced incrementally. The notion of data quality grade is defined to describe the impact of watermark embedding on the usability of data. Four fundamental algorithms are designed to facilitate the processes of watermark embedding, data quality grade detection, watermark detection, and data quality grade enhancement. Before data distribution, numbers of data quality grades can be predefined. Graded reversibility can be achieved by upgrading watermarked data from low to higher data quality grades. A watermark with any data quality grade is enough to claim copyright. With watermarks embedded into different data partitions, flexible watermark reversion can be achieved via partitioned auxiliary data design. A more practical mechanism is devised to efficiently handle hash table collisions and reduce both computational and storage overheads. Tests of the computational performance of the algorithms and their response to various attacks showed that the proposed scheme is feasible and robust.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Riad K, Ke LS (2018) Secure storage and retrieval of IoT data based on private information retrieval. Wirel Commun Mob Comput 2018. https://doi.org/10.1155/2018/5452463

  2. Gao CZ, Lv SY, Wei Y, Wang Z, Liu ZL, Cheng XC (2018) M-SSE: An effective searchable symmetric encryption with enhanced security for mobile devices. IEEE Access 6:38860–38869

    Article  Google Scholar 

  3. Katzenbeisser S, Petitcolas FA (2000) Information hiding techniques for steganography and digital watermarking. Artech House, Norwood

    Google Scholar 

  4. Yu NH (2004) The research of the theories and methods of digital media information hiding. Doctor, University of Science and Technology of China

  5. Cox IJ, Kilian J, Leighton FT, Shamoon T (1997) Secure spread spectrum watermarking for multimedia. IEEE Trans Image Process 6(12):1673–1687

    Article  Google Scholar 

  6. An L, Gao X, Li X, Tao D, Deng C, Li J (2012) Robust reversible watermarking via clustering and enhanced pixel-wise masking. IEEE Trans Image Process 21(8):3598–3611

    Article  MathSciNet  Google Scholar 

  7. Alattar AM (2004) Reversible watermark using the difference expansion of a generalized integer transform. IEEE Trans Image Process 13(8):1147–1156

    Article  MathSciNet  Google Scholar 

  8. Hollaar LA (2002) Legal protection of digital information. BNA Books, New York

    Google Scholar 

  9. Agrawal R, Kiernan J (2002) Watermarking relational databases. In: Proceedings of the 28th international conference on very large data bases. Margan Kaufmann, San Francisco, pp 155–166

  10. Sion R, Atallah M, Prabhakar S (2005) Rights protection for categorical data. IEEE Trans Knowl Data Eng 17(7):912–926

    Article  Google Scholar 

  11. Niu XM, Zhao L, Huang WJ, Zhang H (2003) Watermarking relational databases for ownership protection. Acta Electron Sin 31(s1):2050–2053

    Google Scholar 

  12. Zhang ZH, Jin XM, Wang JM, Li DY (2004) Watermarking relational database using image. Int Conf Mach Learn Cybern 3:1739–1744

    Google Scholar 

  13. Meng YJ, Zhang W, Wu C et al (2006) A relational database watermarking algorithm based on information entropy. J Comput Res Dev 43(s3):262–266

    Google Scholar 

  14. Xiang Y, Li JY, Pan JF (2009) Database watermarking algorithm based on virtual primary key. J Comput Res Dev 46(s1):66–70

    Google Scholar 

  15. Zhou G, Wu KM (2015) Research on zero-watermarking model of relational databases based on improved C4.5 algorithm. Comput Appl Softw 32(1):64–67

    Google Scholar 

  16. Melkundi S, Chandankhede C (2015) A robust technique for relational database watermarking and verification. In: International conference on communication, information & computing technology, IEEE, pp 1–7

  17. Liu K, Liu J, Liu SL (2016) A RS error correcting coding based watermarking algorithm for relational database. Commun Technol 49(6):764–768

    Google Scholar 

  18. Rani S, Koshley DK, Halder R (2017) Adapting mapreduce for efficient watermarking of large relational dataset. In: 2017 IEEE Trustcom/BigDataSE/ICESS, IEEE, pp 729–736

  19. Zhang Y, Yang B, Niu XM (2006) Reversible watermarking for relational database authentication. J Comput 2(17):59–65

    Google Scholar 

  20. Gupta G, Pieprzyk J (2008) Reversible and blind database watermarking using difference expansion. In: Proceedings of the 1st international conference on Forensic applications and techniques in telecommunications, information, and multimedia and workshop, ICST, pp 24–29

  21. Chang JN, Wu HC (2012) Reversible fragile database watermarking technology using difference expansion based on svr prediction. In: International symposium on computer, consumer and control. IEEE, Washington, DC, pp 690–693

  22. Jawad K, Khan A (2013) Genetic algorithm and difference expansion based reversible watermarking for relational databases. J Syst Softw 11(86):2742–2753

    Article  Google Scholar 

  23. Franco-Contreras J, Coatrieux G, Cuppens F et al (2014) Robust lossless watermarking of relational databases based on circular histogram modulation. IEEE Trans Inf Forensics Secur 9(3):397–410

    Article  Google Scholar 

  24. Iftikhar S, Kamran M, Anwar Z (2015) RRW – a robust and reversible watermarking technique for relational data. IEEE Trans Knowl Data Eng 4(27):1132–1145

    Article  Google Scholar 

  25. Zhang Y, Niu XM (2006) Reversible watermarking technique for relational data. Acta Electron Sin 12A(34):2425–2428

    Google Scholar 

  26. Farfoura ME, Horng SJ (2013) A novel blind reversible method for watermarking relational databases. J Chin Inst Eng 1(36):87–97

    Article  Google Scholar 

  27. Imamoglu MB, Ulutas M, Ulutas G (2017) A new reversible database watermarking approach with firefly optimization algorithm. Math Probl Eng 2017(2):1–14

    Article  Google Scholar 

  28. Jiang CX, Cheng XH, Xu XL et al (2017) Reversible database watermark based on integer wavelet transform. J Guilin Univ Technol 37(1):191–195

    Google Scholar 

  29. Feng DG (2011) Security protocols: theory and practice. Tsinghua University Press, Beijing

    Google Scholar 

  30. Hu Y (2010) Research and implementation of RSA algorithm. Master, Beijing University of Posts and Telecommunications

  31. Huang ZG, Lai JZ, Chen WB, Raees-ul-Haq M, Jiang LL (2019) Practical public key encryption with selective opening security for receivers. Inf Sci 478:15–27

    Article  Google Scholar 

  32. Huang ZG, Lai JZ, Chen WB, Li T, Xiang Y (2019) Data security against receiver corruptions: SOA security for receivers from simulatable DEMs. Inf Sci 471:201–215

    Article  Google Scholar 

  33. Rong HG, Mo JX, Chang BG et al (2015) Key distribution and recovery algorithm based on Shamir’s secret sharing. J Commun 2015(3):60–69

    Google Scholar 

  34. TPC-H. http://www.tpc.org/tpch/default.asp. Last accessed 28 Aug 2017

Download references

Acknowledgments

This research is supported by the National Natural Science Foundation of China (Grant No. 61303197) and the Open Project Program of The State Key Laboratory of Integrated Services Networks (ISN19-14). Thanks to Mr. Zhao Yi for his support in the experiments.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Qingdao University, Qingdao, 266071, China

    Ruitao Hou & Hequn Xian

  2. State Key Laboratory of Integrated Services Networks (Xidian University), Xi’an, 710071, China

    Ruitao Hou & Hequn Xian

Authors
  1. Ruitao Hou
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Hequn Xian
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Hequn Xian.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hou, R., Xian, H. A Graded Reversible Watermarking Scheme for Relational Data. Mobile Netw Appl 26, 1552–1563 (2021). https://doi.org/10.1007/s11036-019-01491-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-019-01491-5

Keywords