Sphere packing lower bound on fingerprinting error probability

Negar Kiyavash; Pierre Moulin

doi:10.1117/12.705664

2 March 2007 Sphere packing lower bound on fingerprinting error probability

Negar Kiyavash, Pierre Moulin

Proceedings Volume 6505, Security, Steganography, and Watermarking of Multimedia Contents IX; 65050K (2007) https://doi.org/10.1117/12.705664
Event: Electronic Imaging 2007, 2007, San Jose, CA, United States

Abstract

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.

Citation Download Citation

Negar Kiyavash and 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); https://doi.org/10.1117/12.705664

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available