Equiangular tight frame fingerprinting codes

We show that equiangular tight frames (ETFs) are particularly well suited as additive fingerprint designs against Gaussian averaging collusion attacks when the number of users is less than the square of the signal dimension. The detector performs a binary hypothesis test in order to decide whether a user of interest is among the colluders. Given a maximum coalition size, we show that the geometric figure of merit of distance between the corresponding “guilty” and “not guilty” linear forgeries for each user is bounded away from zero. Moreover, we show that for a normalized correlation detector, reliable detection is guaranteed provided that the number of users is less than the square of the signal dimension. Moreover, we show that the coalition has the best chance of evading detection when it uses equal weights.

[1]  Pierre Moulin,et al.  Regular Simplex Fingerprints and Their Optimality Properties , 2005, IEEE Transactions on Information Forensics and Security.

[2]  David P. Varodayan,et al.  Collusion-aware traitor tracing in multimedia fingerprinting using sparse signal approximation , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  Min Wu,et al.  Anti-collusion fingerprinting for multimedia , 2003, IEEE Trans. Signal Process..

[4]  Alexander Barg,et al.  Digital fingerprinting codes: problem statements, constructions, identification of traitors , 2003, IEEE Trans. Inf. Theory.

[5]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.

[6]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[7]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[8]  Wade Trappe,et al.  Collusion-resistant fingerprints from WBE sequence sets , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[9]  Thomas Strohmer,et al.  GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.

[10]  Pierre Moulin,et al.  Performance of Orthogonal Fingerprinting Codes Under Worst-Case Noise , 2009, IEEE Transactions on Information Forensics and Security.

[11]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .