Related papers: Composable, Unconditionally Secure Message Authent…

It is demonstrated that for the entanglement-based version of the Bennett-Brassard (BB84) quantum key distribution protocol, Alice and Bob share provable entanglement if and only if the estimated qubit error rate is below 25% or above 75%.…

We present a simple protocol where Alice and Bob only needs sending out a coherent state or not-sending out a coherent state to Charlie. There is no bases switching. We show that this protocol is both encoding-state-side-channel free to the…

Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to…

We consider the problem of secret key agreement in Gaussian Maurer's Model. In Gaussian Maurer's model, legitimate receivers, Alice and Bob, and a wire-tapper, Eve, receive signals randomly generated by a satellite through three independent…

This paper examines the properties of the lower and upper bounds established by Maurer, Ahlswede and Csiszar (MAC) for secret-key capacity in the case of channel probing over single-input and single-output (SISO) channels. Inspired by the…

We present a controlled quantum teleportation protocol. In the protocol, quantum information of an unknown state of a 2-level particle is faithfully transmitted from a sender (Alice) to a remote receiver (Bob) via an initially shared…

An elementary derivation of best eavesdropping strategies for the 4 state BB84 quantum cryptography protocol is presented, for both incoherent and two--qubit coherent attacks. While coherent attacks do not help Eve to obtain more…

Secure communication over a wiretap channel is considered in the disadvantaged wireless environment, where the eavesdropper channel is (possibly much) better than the main channel. We present a method to exploit inherent vulnerabilities of…

We propose several methods for quantum key distribution (QKD) based upon the generation and transmission of random distributions of coherent or squeezed states, and we show that they are are secure against individual eavesdropping attacks.…

A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of…

Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect…

We show how two distrustful parties, "Bob" and "Charlie", can share a secret key with the help of a mutually trusted "Alice", counterfactually - that is with no information-carrying particles travelling between any of the three parties.

The growing need for reliable communication over untrusted networks has caused a renewed interest in adversarial channel models, which often behave much differently than traditional stochastic channel models. Of particular practical use is…

Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the…

Cryptanalysis is an important branch in the study of cryptography, including both the classical cryptography and the quantum one. In this paper we analyze the security of two three-party quantum key distribution protocols (QKDPs) proposed…

Simultaneous dense coding guarantees that Bob and Charlie simultaneously receive their respective information from Alice in their respective processes of dense coding. The idea is to use the so-called locking operation to "lock" the…

We present a quantum communication protocol which keeps all the properties of the ping-pong protocol [Phys. Rev. Lett. 89, 187902 (2002)] but improves the capacity doubly as the ping-pong protocol. Alice and Bob can use the variable…

We investigate the correlations that can arise between Alice and Bob in prepare-and-measure communication scenarios where the source (Alice) and the measurement device (Bob) can share prior entanglement. The paradigmatic example of such a…

We present a theoretical and experimental study of a controllable decoherence-assisted quantum key distribution scheme. Our method is based on the possibility of introducing controllable decoherence to polarization qubits using the spatial…

Alice and Bob are connected via a two-way channel, and Alice wants to send a message of $L$ bits to Bob. An adversary flips an arbitrary but finite number of bits, $T$, on the channel. This adversary knows our algorithm and Alice's message,…