2 March 2007 Sphere packing lower bound on fingerprinting error probability
Author Affiliations +
We study the statistical performance of spherical fingerprints for a focused detector which decides whether a user of interest is among the colluders. The colluders create a noise-free forgery by preprocessing their individual copies, and then adding a white Gaussian noise sequence to form the actual forgery. Let N be the codelength, M the number of users, and K the number of colluders. We derive a sphere packing lower bound on the error probability, valid for any triple (N,M,K) and any spherical fingerprinting code.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Negar Kiyavash, Pierre Moulin, "Sphere packing lower bound on fingerprinting error probability", Proc. SPIE 6505, Security, Steganography, and Watermarking of Multimedia Contents IX, 65050K (2 March 2007); doi: 10.1117/12.705664; https://doi.org/10.1117/12.705664


Back to Top