How can one exchange information e? ectively when the medium of com-nication introduces
errors? This question has been investigated extensively starting with the seminal works of …

Separating codes (or systems) are known from combinatorics, and they enjoy increasing
attention due to applications in digital fingerprinting. Previous applications are found in …

We consider the guessing secrets problem defined by Chung et al.[2001]. This is a variant of
the standard 20 questions game where the player has a set of k> 1 secrets from a universe …

Abstract “Token-controlled public key encryption” is a public key encryption scheme where
individual message can be encrypted and sent to every receiver, but the receiver cannot …

A fingerprinting code is a set of codewords that are embedded in each copy of a digital
object, with the purpose of making each copy unique. If the fingerprinting code is c-secure …

The theory of separating systems has been applied in different areas of science and
technology such as automata synthesis, technical diagnosis, and authenticating ownership …

Abstract An (N; n, m,{w_1, ..., w_t\})-separating hash family is a set H of N functions h:\; X ⟶ Y
with| X|= n,| Y|= m, t ≧ 2 having the following property. For any pairwise disjoint subsets …

We suppose we are given some fixed (but unknown) subset X of a set Ω= 𝔽 n 2, where 𝔽2
denotes the field of two elements. Our goal is to learn as much as possible about the …

This paper presents explicit constructions of fingerprinting codes. The proposed
constructions use a class of codes called almost secure frameproof codes. An almost secure …

In der vorliegenden Dissertation wird angestrebt, offene Probleme im Zusammenhang mit
sogenannten “separating hash families” zu diskutieren und zu lösen. Separating hash …