Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

2 Citaten (Scopus)
87 Downloads (Pure)


We study the large-coalition asymptotics of fingerprinting and group testing and derive explicit decoders that provably achieve capacity for many of the considered models. We do this both for simple decoders (which are fast but commonly require larger code lengths) and for joint decoders (which may be slower but achieve the best code lengths). We further make the distinction between informed decoding, where the pirate strategy is exactly known, and uninformed decoding, and we design decoding schemes for both settings. For fingerprinting, we show that if the pirate strategy is known, the Neyman-Pearson-based log-likelihood decoders provably achieve capacity, regardless of the strategy. The decoder built against the interleaving attack is further shown to be a universal decoder, able to deal with arbitrary attacks and achieving the uninformed capacity. This universal decoder is shown to be closely related to the Lagrange-optimized decoder of Oosterwijk et al. and the empirical mutual information decoder of Moulin. Joint decoders are also proposed, and we conjecture that these also achieve the corresponding joint capacities. For group testing, the simple decoder for the classical model is shown to be more efficient than the one of Chan et al. and it provably achieves the simple group testing capacity. For generalizations of this model such as noisy group testing, the resulting simple decoders also achieve the corresponding simple capacities.
Originele taal-2Engels
Pagina's (van-tot)1-15
Aantal pagina's15
TijdschriftEURASIP Journal on Information Security
Nummer van het tijdschrift1
StatusGepubliceerd - 4 jan 2016

Vingerafdruk Duik in de onderzoeksthema's van 'Asymptotics of fingerprinting and group testing: capacity-achieving log-likelihood decoders'. Samen vormen ze een unieke vingerafdruk.

Citeer dit