Fingerprinting With Equiangular Tight Frames

DOI10.1109/TIT.2012.2229781MaRDI QIDQ2989386zbMATH OpenOpenAlexFDO

Authors Dustin G. Mixon, Christopher J. Quinn, Negar Kiyavash, Matthew Fickus

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1111.3376

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: Digital fingerprinting is a framework for marking media files, such as images, music, or movies, with user-specific signatures to deter illegal distribution. Multiple users can collude to produce a forgery that can potentially overcome a fingerprinting system. This paper proposes an equiangular tight frame fingerprint design which is robust to such collusion attacks. We motivate this design by considering digital fingerprinting in terms of compressed sensing. The attack is modeled as linear averaging of multiple marked copies before adding a Gaussian noise vector. The content owner can then determine guilt by exploiting correlation between each user's fingerprint and the forged copy. The worst-case error probability of this detection scheme is analyzed and bounded. Simulation results demonstrate the average-case performance is similar to the performance of orthogonal and simplex fingerprint designs, while accommodating several times as many users.

Cited in

(20)

• Full spark frames
• Frames over finite fields: equiangular lines in orthogonal geometry
• Neural collapse with unconstrained features
• Doubly transitive lines. I: Higman pairs and roux
• Erasure recovery matrices for encoder protection
• Frame scalings: a condition number approach
• Kesten-McKay law for random subensembles of Paley equiangular tight frames
• Frames over finite fields: basic theory and equiangular lines in unitary geometry
• Two are better than one: fundamental parameters of frame coherence
• On Grassmannian frames with spectral constraints
• Packings in real projective spaces
• The optimal packing of eight points in the real projective plane
• Globally optimizing small codes in real projective spaces
• The core of a Grassmannian frame
• Doubly transitive lines. II: Almost simple symmetries
• p-adic Welch bounds and p-adic Zauner conjecture
• Constructions and properties of optimally spread subspace packings
• Testing isomorphism between tuples of subspaces
• On the optimal arrangement of \(2d\) lines in \(\mathbb{C}^d\)
• Frames over finite fields and self-dual codes

This page was built for publication: Fingerprinting With Equiangular Tight Frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989386)