Search problems in cryptography Page 1 Search problems in cryptography: from fingerprinting
to lattice sieving Citation for published version (APA): Laarhoven, T. (2016). Search problems …

The class of joint decoder in fingerprinting codes is of utmost importance in theoretical
papers to establish the concept of fingerprint capacity. However, no implementation …

In this paper, we consider the large-coalition asymptotics of various fingerprinting and group
testing games, and derive explicit expressions for the capacities for each of these models …

Combining an information-theoretic approach to fingerprinting with a more constructive,
statistical approach, we derive new results on the fingerprinting capacities for various …

Abstract 'Don Quixote'is a new accusation process for Tardos traitor tracing codes which is,
as far as we know, the first practical implementation of joint decoding. The first key idea is to …

We study the large-coalition asymptotics of fingerprinting and group testing and derive
explicit decoders that provably achieve capacity for many of the considered models. We do …

We use a method recently introduced by us to study accusation probabilities for non-binary
Tardos fingerprinting codes. We generalize the pre-computation steps in this approach to …

This paper presents yet another attempt towards robust and secure watermarking. Some
recent works have looked at this issue first designing new watermarking schemes with a …

We propose a blind iterative single Tardos decoder for traitor tracing designed to catch as
many colluders as possible while controlling the probability of accusing an innocent. The …

The class of joint decoder of probabilistic fingerprinting codes is of utmost importance in
theoretical papers to establish the concept of fingerprint capacity [1]–[3]. However, no …