SPSW: Database Watermarking Based on Fake Tuples and Sparse Priority Strategy
Zhiwen Ren, Zehua Ma, Weiming Zhang, Nenghai Yu

TL;DR
The paper introduces SPSW, a novel database watermarking scheme that uses fake tuples and a sparse priority strategy to embed watermarks efficiently, improving transparency and robustness while reducing fake tuple insertion.
Contribution
SPSW is the first scheme to embed watermarks with fewer fake tuples by prioritizing sparse watermark sequences, enhancing transparency and robustness.
Findings
Achieves same watermark capacity with fewer fake tuples.
Improves watermark transparency and robustness.
Experimental results outperform existing schemes.
Abstract
Databases play a crucial role in storing and managing vast amounts of data in various organizations and industries. Yet the risk of database leakage poses a significant threat to data privacy and security. To trace the source of database leakage, researchers have proposed many database watermarking schemes. Among them, fake-tuples-based database watermarking shows great potential as it does not modify the original data of the database, ensuring the seamless usability of the watermarked database. However, the existing fake-tuple-based database watermarking schemes need to insert a large number of fake tuples for the embedding of each watermark bit, resulting in low watermark transparency. Therefore, we propose a novel database watermarking scheme based on fake tuples and sparse priority strategy, named SPSW, which achieves the same watermark capacity with a lower number of inserted fake…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Internet Traffic Analysis and Secure E-voting · Spam and Phishing Detection
