By Topic

Regular Simplex Fingerprints and Their Optimality Properties

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kiyavash, N. ; Dept. of Ind. & Enterprise Syst. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA ; Moulin, P. ; Kalker, T.

This paper addresses the design of additive fingerprints that are maximally resilient against linear collusion attacks on a focused correlation detector, as defined below. Let N be the length of the host vector and M les N + 1 the number of users. The focused detector performs a correlation test in order to decide whether a user of interest is among the colluders. Both the fingerprint embedder and the colluders are subject to squared-error distortion constraints. We show that simplex fingerprints maximize a geometric figure of merit for this detector. In that sense they outperform orthogonal fingerprints but the advantage vanishes as M rarr infin. They are also optimal in terms of minimizing the probability of error of the focused detector when the attack is a uniform averaging of the marked copies followed by the addition of white Gaussian noise. Reliable detection is guaranteed provided that the number of colluders K Lt radic(N). Moreover, we study the probability of error performance of simplex fingerprints for the focused correlation detector when the colluders use nonuniform averaging plus white Gaussian noise attacks.

Published in:

Information Forensics and Security, IEEE Transactions on  (Volume:4 ,  Issue: 3 )