False positive probabilities in q-ary Tardos codes : comparison of attacks

A. Simone, B. Skoric

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Uittreksel

We investigate false positive (FP) accusation probabilities for q -ary Tardos codes in the Restricted Digit Model. We employ a computation method recently introduced by us, to which we refer as Convolution and Series Expansion (CSE). We present a comparison of several collusion attacks on q -ary codes: majority voting, minority voting, Interleaving, µ~ -minimizing and Random Symbol (the q -ary equivalent of the Coin Flip strategy). The comparison is made by looking at the FP rate at approximately fixed False Negative rate. In nearly all cases we find that the strongest attack is either minority voting or µ~ -minimizing, depending on the exact setting of parameters such as alphabet size, code length, and coalition size. Furthermore, we present results on the convergence speed of the CSE method, and we show how FP rate computations for the Random Symbol strategy can be sped up by a pre-computation step. Keywords: Traitor tracing; Tardos code; Collusion; Watermarking
TaalEngels
Pagina's519-542
Aantal pagina's24
TijdschriftDesigns, Codes and Cryptography
Volume75
Nummer van het tijdschrift3
DOI's
StatusGepubliceerd - 1 jun 2015

Vingerafdruk

False Positive
Attack
Convolution
Voting
Series Expansion
Traitor Tracing
Watermarking
Collusion Attack
Majority Voting
Collusion
Interleaving
Speed of Convergence
Coalitions
Flip
Digit
Speedup
Strategy
Model

Trefwoorden

    Citeer dit

    @article{bdce9e1f8e224b16a95b6ccb72ef886c,
    title = "False positive probabilities in q-ary Tardos codes : comparison of attacks",
    abstract = "We investigate false positive (FP) accusation probabilities for q -ary Tardos codes in the Restricted Digit Model. We employ a computation method recently introduced by us, to which we refer as Convolution and Series Expansion (CSE). We present a comparison of several collusion attacks on q -ary codes: majority voting, minority voting, Interleaving, µ~ -minimizing and Random Symbol (the q -ary equivalent of the Coin Flip strategy). The comparison is made by looking at the FP rate at approximately fixed False Negative rate. In nearly all cases we find that the strongest attack is either minority voting or µ~ -minimizing, depending on the exact setting of parameters such as alphabet size, code length, and coalition size. Furthermore, we present results on the convergence speed of the CSE method, and we show how FP rate computations for the Random Symbol strategy can be sped up by a pre-computation step. Keywords: Traitor tracing; Tardos code; Collusion; Watermarking",
    keywords = "Collusion, Tardos code, Traitor tracing, Watermarking",
    author = "A. Simone and B. Skoric",
    year = "2015",
    month = "6",
    day = "1",
    doi = "10.1007/s10623-014-9937-5",
    language = "English",
    volume = "75",
    pages = "519--542",
    journal = "Designs, Codes and Cryptography",
    issn = "0925-1022",
    publisher = "Springer",
    number = "3",

    }

    False positive probabilities in q-ary Tardos codes : comparison of attacks. / Simone, A.; Skoric, B.

    In: Designs, Codes and Cryptography, Vol. 75, Nr. 3, 01.06.2015, blz. 519-542.

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    TY - JOUR

    T1 - False positive probabilities in q-ary Tardos codes : comparison of attacks

    AU - Simone,A.

    AU - Skoric,B.

    PY - 2015/6/1

    Y1 - 2015/6/1

    N2 - We investigate false positive (FP) accusation probabilities for q -ary Tardos codes in the Restricted Digit Model. We employ a computation method recently introduced by us, to which we refer as Convolution and Series Expansion (CSE). We present a comparison of several collusion attacks on q -ary codes: majority voting, minority voting, Interleaving, µ~ -minimizing and Random Symbol (the q -ary equivalent of the Coin Flip strategy). The comparison is made by looking at the FP rate at approximately fixed False Negative rate. In nearly all cases we find that the strongest attack is either minority voting or µ~ -minimizing, depending on the exact setting of parameters such as alphabet size, code length, and coalition size. Furthermore, we present results on the convergence speed of the CSE method, and we show how FP rate computations for the Random Symbol strategy can be sped up by a pre-computation step. Keywords: Traitor tracing; Tardos code; Collusion; Watermarking

    AB - We investigate false positive (FP) accusation probabilities for q -ary Tardos codes in the Restricted Digit Model. We employ a computation method recently introduced by us, to which we refer as Convolution and Series Expansion (CSE). We present a comparison of several collusion attacks on q -ary codes: majority voting, minority voting, Interleaving, µ~ -minimizing and Random Symbol (the q -ary equivalent of the Coin Flip strategy). The comparison is made by looking at the FP rate at approximately fixed False Negative rate. In nearly all cases we find that the strongest attack is either minority voting or µ~ -minimizing, depending on the exact setting of parameters such as alphabet size, code length, and coalition size. Furthermore, we present results on the convergence speed of the CSE method, and we show how FP rate computations for the Random Symbol strategy can be sped up by a pre-computation step. Keywords: Traitor tracing; Tardos code; Collusion; Watermarking

    KW - Collusion

    KW - Tardos code

    KW - Traitor tracing

    KW - Watermarking

    UR - http://www.scopus.com/inward/record.url?scp=84928376121&partnerID=8YFLogxK

    U2 - 10.1007/s10623-014-9937-5

    DO - 10.1007/s10623-014-9937-5

    M3 - Article

    VL - 75

    SP - 519

    EP - 542

    JO - Designs, Codes and Cryptography

    T2 - Designs, Codes and Cryptography

    JF - Designs, Codes and Cryptography

    SN - 0925-1022

    IS - 3

    ER -