Related papers: Relativistic quantum coin tossing
A significant branch of classical cryptography deals with the problems which arise when mistrustful parties need to generate, process or exchange information. As Kilian showed a while ago, mistrustful classical cryptography can be founded…
In this work we present a publicly verifiable quantum money protocol which assumes close to no quantum computational capabilities. We rely on one-time memories which in turn can be built from quantum conjugate coding and hardware-based…
Quantum teleportation enables the deterministic exchange of qubits via lossy channels. While it is commonly believed that unconditional teleportation requires a preshared entangled qubit pair, here we demonstrate a protocol that is in…
A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process…
Quantum Game Theory provides us with new tools for practising games and some other risk related enterprices like, for example, gambling. The two party gambling protocol presented by Goldenberg {\it et al} is one of the simplest yet still…
We define cheat sensitive cryptographic protocols between mistrustful parties as protocols which guarantee that, if either cheats, the other has some nonzero probability of detecting the cheating. We give an example of an unconditionally…
Quantum discord quantifies quantum correlation between quantum systems, which has potential application in quantum information processing. In this paper, we propose a scheme realizing the remote transfer of Gaussian quantum discord, in…
The distribution of entanglement between macroscopically separated parties represents a crucial protocol for future quantum information networks. Surprisingly, it has been theoretically shown that two distant systems can be entangled by…
Inspired by the semi-quantum protocols, this paper defines the lightweight quantum security protocols, in which lightweight participants can only operate two out of four very lightweight quantum operations. Subsequently, this study proposes…
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. Our model of quantum broadcast channel is new. (2) We discovered that quantum…
The concept of quantum tokens dates back alongside quantum cryptography to Stephen Wiesner's seminal work in 1983[1]. Already this initial work proposes society-relevant applications such as secure quantum banknotes, which can be exchanged…
We present a quantum protocol for the task of weak coin flipping. We find that, for one choice of parameters in the protocol, the maximum probability of a dishonest party winning the coin flip if the other party is honest is 1/sqrt(2). We…
In recent years Quantum Key Distribution (QKD) has emerged as the most paradigmatic example of Quantum technology allowing the realization of intrinsically secure communication links over hundreds of kilometers. Beyond its commercial…
Necessary and sufficient conditions for deterministic remote extraction and destruction of qubit information encoded in bipartite states using only local operations and classical communications (LOCC) are presented. The conditions indicate…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
Electronic voting is a very useful but challenging internet-based protocol that despite many theoretical approaches and various implementations with different degrees of success, remains a contentious topic due to issues in reliability and…
The transfer or exchange of multipartite quantum states is critical to the realization of large-scale quantum information processing and quantum communication. A challenging question in this context is: What is the minimum resource required…
We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
A set of protocols for atomic quantum state teleportation and swapping utilizing Einstein-Podolsky-Rosen light is proposed. The protocols are suitable for collective spin states of a macroscopic sample of atoms, i.e. for continuous atomic…