scispace - formally typeset
Search or ask a question
Author

Siming Liu

Bio: Siming Liu is an academic researcher from Beihang University. The author has contributed to research in topics: Digital watermarking & Watermark. The author has an hindex of 1, co-authored 1 publications receiving 21 citations.

Papers
More filters
Proceedings ArticleDOI
30 Aug 2006
TL;DR: A scheme of watermarking relational databases based on content characteristic is proposed, and the corresponding algorithms of watermarks embedding and detection are proposed and analyzed by probability.
Abstract: With the development of the Internet and wide applications of databases, the databases providers are worrying about their ownership of the databases. Combined with the digital watermark technique and the characteristic of relational databases, a scheme of watermarking relational databases based on content Characteristic is proposed in this paper. The corresponding algorithms of watermark embedding and detection are proposed and analyzed by probability. Then some watermark embedding and detection experiments are conducted, and the results are analyzed and discussed. In additional, some attacked experiments are conducted to prove the feasibility and the robustness of the proposed algorithms.

21 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: The current state-of-the- art watermarking techniques are surveyed and they are classified according to their intent, the way they express the watermark, the cover type, the granularity level, and their verifiability.
Abstract: Digital watermarking for relational databases emerged as a candidate so- lution to provide copyright protection, tamper detection, traitor tracing, maintaining integrity of relational data. Many watermarking techniques have been proposed in the literature to address these purposes. In this paper, we survey the current state-of-the- art and we classify them according to their intent, the way they express the watermark, the cover type, the granularity level, and their verifiability.

86 citations

Book ChapterDOI
17 Dec 2010
TL;DR: A novel fragile and robust persistent watermarking scheme for relational databases that embeds both private and public watermarks where the former allows the owner to prove his ownership, while the latter allows any end-user to verify the correctness and originality of the data in the database without loss of strength and security.
Abstract: In this paper, we propose a novel fragile and robust persistent watermarking scheme for relational databases that embeds both private and public watermarks where the former allows the owner to prove his ownership, while the latter allows any end-user to verify the correctness and originality of the data in the database without loss of strength and security. The public watermarking is based on a part of the database state which remains invariant under processing of the queries associated with the database, whereas the private watermarking is based on an appropriate form of the original database state, called abstract database, and the semantics-based properties of the data which remain invariant under processing of the associated queries.

25 citations

Proceedings ArticleDOI
16 Dec 2009
TL;DR: A new mechanism is proposed for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data that handles the attack on database like tuple deletion, alteration and insertion.
Abstract: The need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking, and provide desirable properties of a watermarking system for relational data. Proving ownership rights on outsourced relational databases is a crucial issue in today's internet-based application environments and in many content distribution applications. In this paper, new mechanism is proposed for proof of ownership based on the secure embedding of a robust imperceptible watermark in relational data. The steps of the proposed mechanism of watermarking relational database mainly involve decoding and encoding on numerical attribute of relational database. The first phase is to partition the original data and assign partition number to each and every tuple of the relation using Cryptographic Hashing Function (MD5). In the second phase, while changing the data, select the desired watermark and bit bi is selected from the partitioned data and then that bit bi is changed using watermark W. When the original value of data gets changed due to the watermark bit, it always checks the data usability constraints. In the third phase, after inserting the watermark in the partition, merge all partitions and get the complete watermarked data. While decoding, use majority voting algorithm to get the correct watermark. Detecting the watermark neither requires access to the original data nor the watermark. The watermark can be detected even in a small subset of a watermarked relation as long as the sample contains some of the marks. Our technique also handles the attack on database like tuple deletion, alteration and insertion.

17 citations

DOI
04 Oct 2010
TL;DR: This paper proposes a novel persistent watermarking scheme that strictly improves the algorithm proposed by Li and Deng and preserves the persistency of the watermark by exploiting two invariants of the database state w.r.t. the set of queries.
Abstract: Digital watermarking for relational databases emerged as a candidate solution to provide copyright protection of relational data, maintaining integrity of the database information, tamper detection, traitor tracing etc. In this paper, we introduce the notion of persistent wa- termarking that serves as a way to recognize the integrity and ownership proof of the database bounded with a set of queries. It allows the evaluation of the database while applying the queries. We preserve the persistency of the watermark by exploiting two invariants of the database state w.r.t. the set of queries: Stable Cells and Semantics- based Properties of the data. We discuss how we can improve the existing techniques in terms of the persistency of the watermark. Moreover, we propose a novel persistent watermarking scheme that strictly improves the algorithm proposed by Li and Deng. Keywords-Watermarking, Databases, Security

14 citations

Posted Content
TL;DR: A survey of almost all the work done in watermarking and fingerprinting of relational databases has been presented and the direction of future research in these fields is pointed out.
Abstract: Watermarking and fingerprinting of relational databases are quite proficient for ownership protection, tamper proofing, and proving data integrity. In past few years several such techniques have been proposed. A survey of almost all the work done, till date, in these fields has been presented in this paper. The techniques have been classified on the basis of how and where they embed the watermark. The analysis and comparison of these techniques on different merits has also been provided. In the end, this paper points out the direction of future research in these fields.

13 citations