A NOVEL ROBUST SCHEME OF WATERMARKING DATABASE

Jia-jin Le, Qin Zhu, Ying Zhu

2007

Abstract

A scheme for watermarking relational database is proposed in this paper. It is applied to protect the copyright of numeric data. The chaos binary sequences are generated under the control of the privacy key, and are utilized as the watermark signal and the control signal for watermark embedding. Both the privacy key and the primary key determine the watermarking position, and the watermark is embedded into the numeric data by changing the parity of their low order digits, thus avoids the syndrome phenomena caused by the usual Least Significant Bit (LSB) watermarking scheme. The embedment of the watermark meets the requirement of the synchronous dynamic updating for the database, and the detection of the watermark needs no original database. Both the theoretical analysis and the practical experiments prove that this scheme possesses fine efficiency, imperceptibility and security, and it is robust against common attacks towards the watermark.

Paper Citation

in Harvard Style

Le J., Zhu Q. and Zhu Y. (2007). A NOVEL ROBUST SCHEME OF WATERMARKING DATABASE . In Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT, ISBN 978-989-8111-07-4, pages 97-102. DOI: 10.5220/0001336900970102

in Bibtex Style

@conference{icsoft07,
author={Jia-jin Le and Qin Zhu and Ying Zhu},
title={A NOVEL ROBUST SCHEME OF WATERMARKING DATABASE},
booktitle={Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT,},
year={2007},
pages={97-102},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001336900970102},
isbn={978-989-8111-07-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Software and Data Technologies - Volume 3: ICSOFT,
TI - A NOVEL ROBUST SCHEME OF WATERMARKING DATABASE
SN - 978-989-8111-07-4
AU - Le J.
AU - Zhu Q.
AU - Zhu Y.
PY - 2007
SP - 97
EP - 102
DO - 10.5220/0001336900970102