Optimal sequential fingerprinting: Wald vs. Tardos

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)


We study sequential collusion-resistant fingerprinting, where the fingerprinting code is generated in advance but accusations may be made between rounds, and show that in this setting both the dynamic Tardos scheme and schemes building upon Wald's sequential probability ratio test (SPRT) are asymptotically optimal. We further compare these two approaches to sequential fingerprinting, highlighting differences between the two schemes. Based on these differences, we argue that Wald's scheme should in general be preferred over the dynamic Tardos scheme, even though both schemes have their merits. As a side result, we derive an optimal sequential group testing method for the classical model, which can easily be generalized to different group testing models.
Original languageEnglish
Title of host publication3rd ACM Workshop on Information Hiding and Multimedia Security (IH&MMSec'15, Portland OR, USA, June 17-19, 2015)
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Number of pages11
ISBN (Print)978-1-4503-3587-4
Publication statusPublished - 2015
Event3rd ACM Workshop on Information Hiding and Multimedia Security (IH&MMSec 2015) - Portland, United States
Duration: 17 Jun 201519 Jun 2015
Conference number: 3


Conference3rd ACM Workshop on Information Hiding and Multimedia Security (IH&MMSec 2015)
Abbreviated titleIH&MMSec 2015
Country/TerritoryUnited States


Dive into the research topics of 'Optimal sequential fingerprinting: Wald vs. Tardos'. Together they form a unique fingerprint.

Cite this