Earticle

초록

영어

Digital watermarking has been widely applied to relational database for ownership protection and information hiding. But robustness and reversibility are two key challenges due to the frequently database maintaining operators on those tuples. This paper proposes a novel relational database watermarking scheme based on a fast and stable clustering method on database tuples, which adopts Mahalanobis distance as the similarity measurement. Before the process of watermark embedding and detecting, the databases tuples are adaptively clustered into groups according to the length of binary watermark. Moreover the watermark segments are respectively embedded into or detected from those groups according to the numeric field's Lowest Significant Bit (LSB) and polar angle expansion. The majority decision strategy is used to determine the value of watermark bit in blind detection process. The experiment results indicate that the proposed watermarking scheme has higher robustness and reversibility under blind detection against the database maintaining operators.

목차

Abstract
 1. Introduction
 2. Framework and Strategy
 3. Method
  3.1 Tuples Clustering
  3.2 Database Watermarking Algorithm
 4. Simulation Experiment and Analysis
  4.1 Invisibility
  4.2 Test of Database Reversibility
  4.3 Test of Watermarking Robustness
  4.4 Analysis of Algorithm Time Complexity
  4.5 Capacity
  4.6 Robustness Analysis
 5. Conclusion
 Acknowledgments
 References

키워드

저자

• Zhiyong Li [ College of Information Science and Engineering, Hunan University, Changsha, China ]
• Junmin Liu [ College of Information Science and Engineering, Hunan University, Changsha, China ]
• Weicheng Tao [ College of Information Science and Engineering, Hunan University, Changsha, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605