Optimal probabilistic fingerprint codes

By Gábor Tardos. 2008

336 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition, Information Systems, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

In Information Systems

In Signal Processing

Citations in the corpus

Robust Traceability from Trace Amounts (2015, background): “Description of The Attack Like the attacks in previous tracing work for the genomic setting [1], [2], [28]–[30] and in the fingerprinting setting [17], [20], our attack uses a simple scoring function to make its decision.”
Fingerprinting codes and the price of approximate differential privacy (2013, methodology): “[31] Tardos, G. Optimal probabilistic fingerprint codes.”
Between Pure and Approximate Differential Privacy (2015, methodology): “To use this in our reduction, we start with a mechanism M that takes a database of n rows and is ( ε,δ )-di ﬀ erentially private.”
Interactive fingerprinting codes and the hardness of preventing false discovery (2014, methodology): “In this section we deviate from the proof in Tardos (2008). We use biased Fourier analysis to give a more intuitive proof of the correlation bound.”
Simultaneous Private Learning of Multiple Concepts (2015, background): “Tardos [27] showed the existence of an (n, k)-fingerprinting code of optimal length k = Õ(n(2)) (see Proposition 4.”
The Complexity of Differential Privacy (2017, methodology): “18 (Optimal fingerprinting codes [101]).”
Answering n{2+o(1)} counting queries with differential privacy is hard (2012, background): “Tardos [Tar08] gave a construction of ﬁngerprinting codes of essentially optimal length, improving on the original construction of Boneh and Shaw [BS98].”
The Stable Signature: Rooting Watermarks in Latent Diffusion Models (2023, neutral): “The ℓ -th output is labeled by bits of Bob ( i ) and Bob ( j ) ( 00 means both have 0 at position ℓ ): 1.0 0.5 0.0 0.5 1.0 Extractor's outputs 0110 0011 This so-called marking assumption plays a crucial role in traitor tracing literature [27, 55, 83].”
Preventing False Discovery in Interactive Data Analysis Is Hard (2014, background): “They gave a construction with nearly-optimal length, building on the nearly-optimal construction of standard (non-robust) fingerprinting codes by Tardos [Tar08].”
Information Forensics: An Overview of the First Decade (2013, methodology): “Tardos’ Code is an alternative design to the Boneh-Shaw code and has received growing attention in recent years [156], [157].”
Analyze gauss: optimal bounds for privacy-preserving principal component analysis (2014, methodology): “For every n ∈ N and ξ ∈ [0, 1], the construction of [31] gives an (t, n, f, 1 20 , ξ) fingerprinting code such that”
FINGERPRINTING CODES AND THE PRICE OF APPROXIMATE DIFFERENTIAL PRIVACY∗ (2018, methodology): “Tardos [49] constructed a family of fingerprinting codes with a nearly optimal number of users n for a given length d.”