| A Weighted Algorithm for Watermarking Relational Databases |
| |
| 作者姓名： | CUI Xinchun QIN Xiaolin SHENG Gang |
| |
| 作者单位： | [1]College of Information Technology and Communication,Qufu Normal University, Rizhao 276826, Shandong, China; [2]College of Information Science and Technology, NanjingUniversity of Aeronautics and Astronautics, Nanjing 210016,Jiangsu, China; [3]College of Operations Research and Management, QufuNormal University, Rizhao 276826, Shandong, China |
| |
| 基金项目： | Foundation item： Supported by the Aeronautics Science Foundation of China （02F52033）, the High-Technology Research Project of Jiangsu Province （BG2004005） and Youth Research Foundation of Qufu Normal University（XJ02057） |
| |
| 摘 要： | 0 Introduction Watermarking relational database become a hotspot in recent years, it aims to protect copyrights by intro- ducing small errors into the original content without af- fecting the usability for intended purpose. Although some pioneer efforts h…
|
| 关 键 词： | 数据库 水印技术 计算机 计算法则 版权保护 |
| 文章编号： | 1007-1202（2007）01-0079-04 |
| 收稿时间： | 2006-05-20 |
A weighted algorithm for watermarking relational databases |
| |
| CUI Xinchun QIN Xiaolin SHENG Gang.A Weighted Algorithm for Watermarking Relational Databases[J].Wuhan University Journal of Natural Sciences,2007,12(1):79-82. |
| |
| Authors: | Cui Xinchun Qin Xiaolin Sheng Gang |
| |
| Institution: | (1) College of Information Technology and Communication, Qufu Normal University, Rizhao, 276826, Shandong, China;(2) College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, Jiangsu, China;(3) College of Operations Research and Management, Qufu Normal University, Rizhao, 276826, Shandong, China |
| |
| Abstract: | A weighted algorithm for watermarking relational databases for copyright protection is presented. The possibility of watermarking an attribute is assigned according to its weight decided by the owner of the database. A one-way hash function and a secret key known only to the owner of the data are used to select tuples and bits to mark. By assigning high weight to significant attributes, the scheme ensures that important attributes take more chance to be marked than less important ones. Experimental results show that the proposed scheme is robust against various forms of attacks, and has perfect immunity to subset attack. |
| |
| Keywords: | weighted algorithm watermarking relational databases copyright protection |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
