C

Christian Schaffner

Centrum Wiskunde & Informatica

ORCID: 0000-0002-1754-1415

Publishes on Quantum Computing Algorithms and Architecture, Quantum Information and Cryptography, Cryptography and Data Security. 119 papers and 6.7k citations.

119Publications
6.7kTotal Citations

Is this you? Claim your profile.

Add your photo, update your bio, and get notified when your ranking changes.

Top publicationsby citations

4-Nonylphenol in Sewage Sludge: Accumulation of Toxic Metabolites from Nonionic Surfactants
Cited by 739

Anaerobically treated sewage sludge was found to contain extraordinarily high concentrations of 4-nonylphenol, a metabolite derived from nonionic surfactants of the nonylphenol polyethoxylate type. Concentrations in activated sewage sludge, in mixed primary and secondary sludge, and in aerobically stabilized sludge were substantially lower, suggesting that the formation of 4-nonylphenol is favored under mesophilic anaerobic conditions. Because 4-nonylphenol may be highly toxic to aquatic life, further research is needed on the fate of 4-nonylphenol after sludge is disposed of in the environment.

The Operational Meaning of Min- and Max-Entropy
Robert König, Renato Renner, Christian Schaffner|IEEE Transactions on Information Theory|2009
Cited by 682Open Access

In this paper, we show that the conditional min-entropy <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">min</sub> ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> | <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> ) of a bipartite state <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">rhoAB</i> is directly related to the maximum achievable overlap with a maximally entangled state if only local actions on the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> -part of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">rhoAB</i> are allowed. In the special case where <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> is classical, this overlap corresponds to the probability of guessing <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> given <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> . In a similar vein, we connect the conditional max-entropy <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">max</sub> ( <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> | <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> ) to the maximum fidelity of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">rhoAB</i> with a product state that is completely mixed on <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> . In the case where <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> is classical, this corresponds to the security of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> when used as a secret key in the presence of an adversary holding <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> . Because min- and max-entropies are known to characterize information-processing tasks such as randomness extraction and state merging, our results establish a direct connection between these tasks and basic operational problems. For example, they imply that the (logarithm of the) probability of guessing <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> given <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> is a lower bound on the number of uniform secret bits that can be extracted from <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> relative to an adversary holding <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</i> .

Leftover Hashing Against Quantum Side Information
Marco Tomamichel, Christian Schaffner, Adam Smith et al.|IEEE Transactions on Information Theory|2011
Cited by 300Open Access

The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random. In its standard formulation, the lemma refers to a notion of randomness that is (usually implicitly) defined with respect to classical side information. Here, a strictly more general version of the Leftover Hash Lemma that is valid even if side information is represented by the state of a quantum system is shown. Our result applies to almost two-universal families of hash functions. The generalized Leftover Hash Lemma has applications in cryptography, e.g., for key agreement in the presence of an adversary who is not restricted to classical information processing.