Performance of Random Fingerprinting Codes Under Arbitrary Nonlinear Attacks

This paper analyzes the performance of arbitrary nonlinear collusion attacks on random fingerprinting codes. We derive the error exponent of the fingerprinting system, which determines the exponential decay of the error probability. A Gaussian ensemble and an expurgated Gaussian ensemble of codes ar...

Full description

Saved in:
Bibliographic Details
Published in2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07 Vol. 2; pp. II-157 - II-160
Main Authors Moulin, P., Kiyevash, N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2007
Subjects
coding
Data security
detection performance
Detectors
Digital fingerprinting
Digital signal processing
Error probability
Fingerprint recognition
Forgery
Gaussian distribution
Gaussian noise
Nonlinear distortion
nonlinear signal processing
Performance analysis
Online AccessGet full text

Cover

More Information
Summary:This paper analyzes the performance of arbitrary nonlinear collusion attacks on random fingerprinting codes. We derive the error exponent of the fingerprinting system, which determines the exponential decay of the error probability. A Gaussian ensemble and an expurgated Gaussian ensemble of codes are considered. The collusion attacks include order-statistics attacks as special cases. In our model, a correlation detector is used. The colluders create a noise-free forgery by applying an arbitrary nonlinear mapping to their individual copies, and next they add a Gaussian noise sequence to form the final forgery. The colluders are subject to a mean-squared distortion constraint between host and forgery. We prove that the uniform linear averaging attack outperforms all others.
ISBN:9781424407279
1424407273
ISSN:1520-6149
DOI:10.1109/ICASSP.2007.366196