Watermarking Generative Tabular Data
About
In this paper, we introduce a simple yet effective tabular data watermarking mechanism with statistical guarantees. We show theoretically that the proposed watermark can be effectively detected, while faithfully preserving the data fidelity, and also demonstrates appealing robustness against additive noise attack. The general idea is to achieve the watermarking through a strategic embedding based on simple data binning. Specifically, it divides the feature's value range into finely segmented intervals and embeds watermarks into selected ``green list" intervals. To detect the watermarks, we develop a principled statistical hypothesis-testing framework with minimal assumptions: it remains valid as long as the underlying data distribution has a continuous density function. The watermarking efficacy is demonstrated through rigorous theoretical analysis and empirical validation, highlighting its utility in enhancing the security of synthetic and real-world datasets.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Tabular Data Watermarking | magic | Density91.5 | 11 | |
| Tabular Data Watermarking | Adult | Density91.2 | 11 | |
| Tabular Data Watermarking | Drybean | Density0.929 | 11 | |
| Tabular Data Watermarking | Shoppers | Density0.903 | 11 | |
| Tabular Data Watermarking | DEFAULT | Density92.6 | 11 | |
| Watermark robustness against attacks | Adult | Error Rate (Row Del. 20%)14.76 | 10 | |
| Watermark robustness against attacks | Shoppers | Performance (Row Del. 20%)36.82 | 5 | |
| Watermark robustness against attacks | Drybean | Row Deletion (20%) Robustness Score117 | 5 | |
| Watermarking Robustness | Drybean | Robustness Score (Row Deletion)117 | 5 | |
| Watermarking Robustness | Shoppers | Row Deletion Robustness36.82 | 5 |