基于聚类和极角扩展的鲁棒可逆关系数据库水印算法
67 浏览量
2021-04-09
19:22:00
上传
评论
收藏 761KB PDF 举报
Robust and Reversible Relational Database
Watermarking Algorithm Based on Clustering and Polar
Angle Expansion
Zhiyong Li, Junmin Liu and Weicheng Tao
College of Information Science and Engineering, Hunan University, Changsha, China
zhiyong.li@hnu.edu.cn, 3268601[email protected]om, weishens1985@hotmail.com
Abstract. 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.
Keywords: Database watermarking, robustness, reversibility, blind detection,
tuples clustering, polar angle expansion.
1 Introduction
Digital watermarking is developed in recent years as a potential information
security key technology, which can determine the ownership or originality of digital
content by embedding perceivable or unperceivable information in digital works [1].
It has better characteristics on security, invisibility and robustness [2]. Similarly,
database watermarking has been proposed on large database security-control.
However, there are some differences between relational database and multimedia data
[3]. So database watermarking should also have the ability of real-time update and
blind detection and cannot directly adopt those multimedia watermarking method. It
is more difficult to ensure the robustness and reversibility of database watermarking.
In recent years, scholars have carried out extensive research on database
watermarking. The groundbreaking study in this area was conducted by R. Agrawal
and R. Sion in 2002 [4], [5]. In 2003, X.M. Niu proposed that a meaningful string
1
评论0
最新资源