Related papers: Unifying classical and quantum key distillation
We present a simple method to obtain an upper bound on the achievable secret key rate in quantum key distribution (QKD) protocols that use only unidirectional classical communication during the public-discussion phase. This method is based…
The advent of quantum key distribution (QKD) has revolutionized secure communication by providing unconditional security, unlike classical cryptographic methods. However, its effectiveness relies on robust identity authentication, as…
We present a continuous variable (CV) quantum key distribution (QKD) scheme based on the CV quantum teleportation of coherent states that yields a raw secret key made up of discrete variables for both Alice and Bob. This protocol preserves…
We answer an open question about Quantum Key Recycling (QKR): Is it possible to put the message entirely in the qubits without increasing the number of qubits? We show that this is indeed possible. We introduce a prepare-and-measure QKR…
Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity…
We present a generalized tomographic quantum key distribution protocol in which the two parties share a Bell diagonal mixed state of two qubits. We show that if an eavesdropper performs a coherent measurement on many quantum ancilla states…
Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics. Composability-based…
The cryptographic protocol of coin tossing consists of two parties, Alice and Bob, that do not trust each other, but want to generate a random bit. If the parties use a classical communication channel and have unlimited computational…
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state $\rho$ which is ``reasonably close'' to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the…
We demonstrate that two spatially separated parties (Alice and Bob) can utilize shared prior quantum entanglement, and classical communications, to establish a synchronized pair of atomic clocks. In contrast to classical synchronization…
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…
Unconditional security in quantum key distribution (QKD) relies on authenticating the identities of users involved in key distribution. While classical identity authentication schemes were initially utilized in QKD implementations, concerns…
A notion of asymmetric quantum dialogue (AQD) is introduced. Conventional protocols of quantum dialogue are essentially symmetric as both the users (Alice and Bob) can encode the same amount of classical information. In contrast, the scheme…
In this paper, we consider a quantum key distribution protocol (QKD) with two-way classical communication that is assisted by one-time pad encryption. We propose a two-way preprocessing that uses one-time pad encryption by previously shared…
Using the generalized Bell states and controlled not gates, we introduce an enatanglement-based quantum key distribution (QKD) of d-level states (qudits). In case of eavesdropping, Eve's information gain is zero and a quantum error rate 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.…
We show that non-maximally entangled states can be used to build a quantum key distribution (QKD) scheme whose security and key rate transmission is nearly equivalent to those of standard QKD protocols. These aspects can be controlled by…
Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output. In this work, we consider the setting where the two parties (a classical…
We consider the scenario where Alice wants to send a secret (classical) $n$-bit message to Bob using a classical key, and where only one-way transmission from Alice to Bob is possible. In this case, quantum communication cannot help to…
Quantum cryptography is the study of delivering secret communications across a quantum channel. Recently, Quantum Key Distribution (QKD) has been recognized as the most important breakthrough in quantum cryptography. This process…