Sphere packing lower bound on fingerprinting error probability

Negar Kiyavash, Pierre Moulin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings of SPIE-IS and T Electronic Imaging - Security, Steganography, and Watermarking of Multimedia Contents IX
PublisherSPIE
ISBN (Print)0819466182, 9780819466181
DOIs
StatePublished - Jan 1 2007
EventSecurity, Steganography, and Watermarking of Multimedia Contents IX - San Jose, CA, United States
Duration: Jan 29 2007Feb 1 2007

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume6505
ISSN (Print)0277-786X

Other

OtherSecurity, Steganography, and Watermarking of Multimedia Contents IX
CountryUnited States
CitySan Jose, CA
Period1/29/072/1/07

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Sphere packing lower bound on fingerprinting error probability'. Together they form a unique fingerprint.

Cite this