— New channel coding converse and achievability bounds are derived. Both bounds are expressed using a quantity called the " smooth 0-divergence ". As the block-length tends to infinity and the error probability is required to tend to zero, the bounds coincide to give a capacity formula which is equivalent to the one derived by Verdú and Han.
In classical and quantum information theory, operational quantities such as the amount of ran-domness that can be extracted from a given source or the amount of space needed to store given data are normally characterized by one of two entropy measures, called smooth min-entropy and smooth max-entropy, respectively. While both entropies are equal to the von… (More)
2010 ii Acknowledgments This thesis would never have been possible without the support of many people. First of all I would like to thank Stefan Wolf who has been a great advisor, giving us a lot of freedom in our research. Still, his door was always open for discussions. I would like to thank Renato Renner for an intense and fruitful collaboration which… (More)
Device-independent quantum key distribution is the task of using uncharacterized quantum devices to establish a shared key between two users. If a protocol is secure regardless of the device behaviour, it can be used to generate a shared key even if the supplier of the devices is malicious. To date, all device-independent quantum key distribution protocols… (More)
We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.
According to quantum theory, measurements generate random outcomes, in stark contrast with classical mechanics. This raises the question of whether there could exist an extension of the theory that removes this indeterminism, as suspected by Einstein, Podolsky and Rosen. Although this has been shown to be impossible, existing results do not imply that the… (More)
Alice is a charismatic quantum cryptographer who believes her parties are unmissable; Bob is a 1 glamorous string theorist who believes he is an indispensable guest. To prevent possibly traumatic collisions of self-perception and reality, their social code requires that decisions about invitation or acceptance be made via a cryptographically secure variable… (More)