Good digital fingerprinting codes

Good digital fingerprinting codes

We construct binary t-secure fingerprinting codes (t=const) of size M=exp(cn), where n is the length of the fingerprint, for which the dealer (decoder) can recover at least one of the users from the colluding coalition with probability 1-exp(-f(c)n). For the case t=2 we construct codes with the prop...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Barg, A., Blakley, G.R., Kabatiansky, G.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Decoding
Error analysis
Error probability
Fingerprint recognition
Mathematics
Printing
Probability distribution
Radio access networks
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We construct binary t-secure fingerprinting codes (t=const) of size M=exp(cn), where n is the length of the fingerprint, for which the dealer (decoder) can recover at least one of the users from the colluding coalition with probability 1-exp(-f(c)n). For the case t=2 we construct codes with the property that the dealer can either recover both users of the coalition with probability 1-exp{(const)n}, or identifies one of them with probability 1.
DOI:10.1109/ISIT.2001.936024