Related papers: An Entanglement-Based Protocol For Strong Coin Tos…
We demonstrate a prototype-implementation of deterministic information encoding for quantum key distribution (QKD) following the ping-pong coding protocol [K. Bostroem, T. Felbinger, Phys. Rev. Lett. 89 (2002) 187902-1]. Due to the…
In the distributed quantum computing paradigm, well-controlled few-qubit `nodes' are networked together by connections which are relatively noisy and failure prone. A practical scheme must offer high tolerance to errors while requiring only…
Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction of asymptotically secure protocols. Here, we…
Based on quantum entanglement, an all-or-nothing oblivious transfer protocol is proposed and is proven to be secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. More intriguingly, this…
In the task cryptographers call bit commitment, one party encrypts a prediction in a way that cannot be decrypted until they supply a key, but has only one valid key. Bit commitment has many applications, and has been much studied, but…
Quantum communication is an important application that derives from the burgeoning field of quantum information and quantum computation. Focusing on secure communication, quantum cryptography has two major directions of development, namely…
Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment has been proven impossible through asynchronous exchange of classical and quantum information.…
A simple protocol which takes advantage of the inherent random times of detections in single photon counting modules is presented for random active basis choices when using entanglement-based protocols for Quantum Key Distribution (QKD). It…
Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence…
We consider an asynchronous network of $n$ parties connected to each other via secure channels, up to $t$ of which are byzantine. We study common coin tossing, a task where the parties try to agree on an unpredictable random value, with…
Entanglement across distant frequency bands is a crucial resource in quantum networking. However, directly entangling crossband photons, e.g., microwave and optical, is challenging. Furthermore, distributing crossband entanglement via…
Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication.…
A quantum key distribution protocol based on entanglement swapping is proposed. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping and obtain the secure key.…
Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed…
For more than a decade, it was believed that unconditionally secure quantum bit commitment (QBC) is impossible. But basing on a previously proposed quantum key distribution scheme using orthogonal states, here we build a QBC protocol in…
An entanglement-generating protocol is described for two qubits coupled to a cavity field in the bad-cavity limit. By measuring the amplitude of a field transmitted through the cavity, an entangled spin-singlet state can be established…
A quantum key distribution protocol with classical Bob based on polarization entangled photon pairs is presented. It approximates a single photon and exploited the inherent randomness of quantum measurements to attain highly secure keys and…
We develop a model for practical, entanglement-based long-distance quantum key distribution employing entanglement swapping as a key building block. Relying only on existing off-the-shelf technology, we show how to optimize resources so as…
We propose one and a half criteria for determining how many measurements are needed to quantify entanglement reliably. We base these criteria on Bayesian analysis of measurement results, and apply our methods to four-qubit entanglement, but…
Two closely spaced dangling bonds positioned on a silicon surface and sharing an excess electron are revealed to be a strong candidate for a charge qubit. Based on our study of the coherent dynamics of this qubit, its extremely high…