Compressive list-support recovery for colluder identification

One of the main computational challenges in digital fingerprinting systems is the complexity of colluder identification. Inspired by compressive sensing approaches for support recovery of sparse vectors, we propose a novel list-decoding approach for partial colluder identification. We also derive formulas for the minimum codelength required for identifying a nonzero fraction of colluders based on noiseless and noisy measurements, using simple single-step correlation maximization techniques.