Watermarking Generative Categorical Data
원문 초록
In this paper, we propose a novel statistical framework for watermarking generative categorical data. Our method systematically embeds pre-agreed secret signals by splitting the data distribution into two components and modifying one distribution based on a deterministic relationship with the other, ensuring the watermark is embedded at the distribution-level. To verify the watermark, we introduce an insertion inverse algorithm and detect its presence by measuring the total variation distance between the inverse-decoded data and the original distribution. Unlike previous categorical watermarking methods, which primarily focus on embedding watermarks into a given dataset, our approach operates at the distribution-level, allowing for verification from a statistical distributional perspective. This makes it particularly well-suited for the modern paradigm of synthetic data generation, where the underlying data distribution, rather than specific data points, is of primary importance. The effectiveness of our method is demonstrated through both theoretical analysis and empirical validation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
How Good Are Synthetic Requirements ? Evaluating LLM-Generated Datasets for AI4RE
SDialog: A Python Toolkit for Synthetic Dialogue Generation and Analysis
Cosmos-Drive-Dreams: Scalable Synthetic Driving Data Generation with World Foundation Models
Optimization-Free Universal Watermark Forgery with Regenerative Diffusion Models
BEAR: BGP Event Analysis and Reporting
Datasheets Aren't Enough: DataRubrics for Automated Quality Metrics and Accountability
토론
이 논문과 연결된 포럼 글이 아직 없습니다.