A formula for the capacity of a quantum channel for transmitting private classical information
is derived. This is shown to be equal to the capacity of the channel for generating a secret …

We derive a new upper bound for Eve's information in secret key generation from a common
random number without communication. This bound improves on Bennett's bound based on …

Several nonasymptotic formulas are established in channel resolvability and identification
capacity, and they are applied to the wiretap channel. By using these formulas, the epsi …

Quantum Shannon theory is loosely defined as a collection of coding theorems, such as
classical and quantum source compression, noisy channel coding theorems, entanglement …

Quantum mechanics has led not only to new physical theories, but also a new
understanding of information and computation. Quantum information began by yielding new …

We show that oblivious transfer of bits from A to B can be obtained from a single instance of
the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in …

This volume is a researcher's reference handbook to the many aspects of nanometer
structures. Although intended as a source for the serious researcher, novices will find a great …

Oblivious transfer (OT) is a cryptographic primitive of central importance, in particular in two-
and multi-party computation. There exist various protocols for different variants of OT, but …

Bit commitment protocols whose security is based on the laws of quantum mechanics alone
are generally held to be impossible. We give a strengthened and explicit proof of this result …

We consider information theoretic secret key (SK) agreement and secure function
computation by multiple parties observing correlated data, with access to an interactive …