Collusion-resistant Fingerprinting of Parallel Content Channels

Basheer Joudeh; Boris Škorić

doi:10.1145/3531536.3532953

Collusion-resistant Fingerprinting of Parallel Content Channels

Basheer Joudeh, Boris Škorić

Security

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Downloads (Pure)

Abstract

The fingerprinting game is analysed when the coalition size k is known to the tracer, but the colluders can distribute themselves across L TV channels. The collusion channel is introduced and the extra degrees of freedom for the coalition are made manifest in our formulation. We introduce a payoff functional that is analogous to the single TV channel case, and is conjectured to be closely related to the fingerprinting capacity. For the binary alphabet case under the marking assumption, and the restriction of access to one TV channel per person per segment, we derive the asymptotic behavior of the payoff functional. We find that the value of the maximin game for our payoff is asymptotically equal to L2/k2 2 ln 2, with optimal strategy for the tracer being the arcsine distribution, and for the coalition being the interleaving attack across all TV channels, as well as assigning an equal number of colluders across the L TV channels.

Original language	English
Title of host publication	IH&MMSec '22
Subtitle of host publication	Proceedings of the 2022 ACM Workshop on Information Hiding and Multimedia Security
Place of Publication	New York
Publisher	Association for Computing Machinery, Inc.
Pages	81-89
Number of pages	9
ISBN (Electronic)	978-1-4503-9355-3
DOIs	https://doi.org/10.1145/3531536.3532953
Publication status	Published - 23 Jun 2022
Event	2022 ACM Workshop on Information Hiding and Multimedia Security, IH-MMSec 2022 - Santa Barbara, United States Duration: 27 Jun 2022 → 28 Jun 2022

Conference

Conference	2022 ACM Workshop on Information Hiding and Multimedia Security, IH-MMSec 2022
Country/Territory	United States
City	Santa Barbara
Period	27/06/22 → 28/06/22

Funding

Part of this work was supported by NWO grant CS.001 (Forwardt).

Keywords

collusion attack
information theoretic security
traitor tracing
watermarking

Access to Document

10.1145/3531536.3532953

pdfFinal published version, 1.1 MBLicence: CC BY

Cite this

@inproceedings{d3bceb0503a24f509623c5409cf10a06,

title = "Collusion-resistant Fingerprinting of Parallel Content Channels",

abstract = "The fingerprinting game is analysed when the coalition size k is known to the tracer, but the colluders can distribute themselves across L TV channels. The collusion channel is introduced and the extra degrees of freedom for the coalition are made manifest in our formulation. We introduce a payoff functional that is analogous to the single TV channel case, and is conjectured to be closely related to the fingerprinting capacity. For the binary alphabet case under the marking assumption, and the restriction of access to one TV channel per person per segment, we derive the asymptotic behavior of the payoff functional. We find that the value of the maximin game for our payoff is asymptotically equal to L2/k2 2 ln 2, with optimal strategy for the tracer being the arcsine distribution, and for the coalition being the interleaving attack across all TV channels, as well as assigning an equal number of colluders across the L TV channels.",

keywords = "collusion attack, information theoretic security, traitor tracing, watermarking",

author = "Basheer Joudeh and Boris {\v S}kori{\'c}",

year = "2022",

month = jun,

day = "23",

doi = "10.1145/3531536.3532953",

language = "English",

pages = "81--89",

booktitle = "IH\&MMSec '22",

publisher = "Association for Computing Machinery, Inc.",

address = "United States",

note = "2022 ACM Workshop on Information Hiding and Multimedia Security, IH-MMSec 2022 ; Conference date: 27-06-2022 Through 28-06-2022",

}

Joudeh, B & Škorić, B 2022, Collusion-resistant Fingerprinting of Parallel Content Channels. in IH&MMSec '22: Proceedings of the 2022 ACM Workshop on Information Hiding and Multimedia Security. Association for Computing Machinery, Inc., New York, pp. 81-89, 2022 ACM Workshop on Information Hiding and Multimedia Security, IH-MMSec 2022, Santa Barbara, United States, 27/06/22. https://doi.org/10.1145/3531536.3532953

Collusion-resistant Fingerprinting of Parallel Content Channels. / Joudeh, Basheer ; Škorić, Boris.
IH&MMSec '22: Proceedings of the 2022 ACM Workshop on Information Hiding and Multimedia Security. New York: Association for Computing Machinery, Inc., 2022. p. 81-89.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Collusion-resistant Fingerprinting of Parallel Content Channels

AU - Joudeh, Basheer

AU - Škorić, Boris

PY - 2022/6/23

Y1 - 2022/6/23

N2 - The fingerprinting game is analysed when the coalition size k is known to the tracer, but the colluders can distribute themselves across L TV channels. The collusion channel is introduced and the extra degrees of freedom for the coalition are made manifest in our formulation. We introduce a payoff functional that is analogous to the single TV channel case, and is conjectured to be closely related to the fingerprinting capacity. For the binary alphabet case under the marking assumption, and the restriction of access to one TV channel per person per segment, we derive the asymptotic behavior of the payoff functional. We find that the value of the maximin game for our payoff is asymptotically equal to L2/k2 2 ln 2, with optimal strategy for the tracer being the arcsine distribution, and for the coalition being the interleaving attack across all TV channels, as well as assigning an equal number of colluders across the L TV channels.

AB - The fingerprinting game is analysed when the coalition size k is known to the tracer, but the colluders can distribute themselves across L TV channels. The collusion channel is introduced and the extra degrees of freedom for the coalition are made manifest in our formulation. We introduce a payoff functional that is analogous to the single TV channel case, and is conjectured to be closely related to the fingerprinting capacity. For the binary alphabet case under the marking assumption, and the restriction of access to one TV channel per person per segment, we derive the asymptotic behavior of the payoff functional. We find that the value of the maximin game for our payoff is asymptotically equal to L2/k2 2 ln 2, with optimal strategy for the tracer being the arcsine distribution, and for the coalition being the interleaving attack across all TV channels, as well as assigning an equal number of colluders across the L TV channels.

KW - collusion attack

KW - information theoretic security

KW - traitor tracing

KW - watermarking

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

U2 - 10.1145/3531536.3532953

DO - 10.1145/3531536.3532953

M3 - Conference contribution

AN - SCOPUS:85134157614

SP - 81

EP - 89

BT - IH&MMSec '22

PB - Association for Computing Machinery, Inc.

CY - New York

T2 - 2022 ACM Workshop on Information Hiding and Multimedia Security, IH-MMSec 2022

Y2 - 27 June 2022 through 28 June 2022

ER -

Collusion-resistant Fingerprinting of Parallel Content Channels

Abstract

Conference

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this