Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

3-2006

Abstract

Today, watermarking techniques have been extended from the multimedia context to relational databases so as to protect the ownership of data even after the data are published or distributed. However, all existing watermarking schemes for relational databases are secret key based, thus require a secret key to be presented in proof of ownership. This means that the ownership can only be proven once to the public (e.g., to the court). After that, the secret key is known to the public and the embedded watermark can be easily destroyed by malicious users. Moreover, most of the existing techniques introduce distortions to the underlying data in the watermarking process, either by modifying least significant bits or exchanging categorical values. The distortions inevitably reduce the value of the data. In this paper, we propose a watermarking scheme by which the ownership of data can be publicly proven by anyone, as many times as necessary. The proposed scheme is distortion-free, thus suitable for watermarking any type of data without fear of error constraints. The proposed scheme is robust against typical database attacks including tuple/attribute insertion/deletion, random/selective value modification, data frame-up, and additive attacks.

Keywords

Relational database, ownership protection, public verifiability, watermark, certificate

Discipline

Information Security

Research Areas

Cybersecurity

Publication

ASIACCS '06: Proceedings of the ACM Symposium on Information, Computer and Communications Security: Taipei, Taiwan, 21-24 March

First Page

78

Last Page

89

ISBN

9781595932723

Identifier

10.1145/1128817.1128832

Publisher

ACM

City or Country

New York

Copyright Owner and License

Publisher

Additional URL

https://doi.org/10.1145/1128817.1128832

Download

Share

COinS