• Publications
  • Influence
Security of quantum key distribution
  • R. Renner
  • Computer Science
    Ausgezeichnete Informatikdissertationen
  • 1 December 2005
This work proposes an approach which allows us to study general physical systems for which the above mentioned independence condition does not necessarily hold, and introduces new uncertainty measures, called smooth min- and max-entropy, which are generalizations of information-theoretical notions.
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
The goals of this paper are two-fold. First we introduce and motivate a generalization of the fundamental concept of the indistinguishability of two systems, called indifferentiability. This
Quantum theory cannot consistently describe the use of itself
A variant of Wigner’s friend Gedankenexperiment where each of the current interpretations of QM fails in giving a consistent description, indicating that quantum theory cannot be extrapolated to complex systems, at least not in a straightforward manner.
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
It is shown that the two new quantities, and related notions, do not only extend Shannon entropy in the described contexts, but they also share central properties of the latter such as the chain rule as well as sub-additivity and monotonicity.
The Operational Meaning of Min- and Max-Entropy
The results establish a direct connection between min- and max-entropies, known to characterize information-processing tasks such as randomness extraction and state merging, and basic operational problems.
Tight finite-key analysis for quantum cryptography
Here it is shown that gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies.
Smooth Renyi entropy and applications
  • R. Renner, S. Wolf
  • Computer Science
    International Symposium onInformation Theory…
  • 27 June 2004
We introduce a new entropy measure, called smooth Renyi entropy. The measure characterizes fundamental properties of a random variable Z, such as the amount of uniform randomness that can be
A Fully Quantum Asymptotic Equipartition Property
A fully quantum generalization of the classical asymptotic equipartition property is shown, where both the output of the experiment and side information are quantum.
Information-theoretic security proof for quantum-key-distribution protocols (17 pages)
This work investigates a general class of QKD protocols with one-way classical post-processing and gives new lower and upper bounds on the secret-key rate which only involve entropies of two-qubit density operators and which are thus easy to compute.
Universally Composable Privacy Amplification Against Quantum Adversaries
It is shown that, even if an adversary holds quantum information about the initial string Z, the key S obtained by two-universal hashing is secure, according to a universally composable security definition, which implies that many of the known quantum key distribution protocols are universally Composable.