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 …

It has been proven that the code lengths of Tardos's collusion-secure fingerprinting codes
are of theoretically minimal order with respect to the number of adversarial users (pirates) …

Including a unique code in each copy of a distributed document is an effective way of
fighting intellectual piracy. Codes designed for this purpose that are secure against collusion …

Though the science of hiding a message within a host carrier dates back to ancient Greeks
or even before, data hiding technology has been revitalized starting from mid-1990s [8, 23] …

G. Tardos 1 was the first to give a construction of a fingerprinting code whose length meets
the lowest known bound in O(c^2\logn1). This was a real breakthrough because the …

Asymmetric fingerprinting protocols are designed to prevent an untrustworthy Provider
incriminating an innocent Buyer. These protocols enable the Buyer to generate their own …

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 …

Sharing genomic databases is critical to the collaborative research in computational biology.
A shared database is more informative than specific genome-wide association studies …

This article deals with traitor tracing which is also known as active fingerprinting, content
serialization, or user forensics. We study the impact of worst case attacks on the well-known …

We construct binary dynamic traitor tracing schemes, where the number of watermark bits
needed to trace and disconnect any coalition of pirates is quadratic in the number of pirates …