Related papers: Quantum contract signing with entangled pairs
Cyclic quantum teleportation schemes requires at least the existence of three collaborators acting all as senders and receivers of quantum information, each one of them has an information to be transmitted to the next neighbour in a…
Quantum gambling --- a secure remote two-party protocol which has no classical counterpart --- is demonstrated through optical approach. A photon is prepared by Alice in a superposition state of two potential paths. Then one path leads to…
Two schemes for sharing an arbitrary two-qubit state based on entanglement swapping are proposed with Bell-state measurements and local unitary operations. One is based on the quantum channel with four Einstein-Podolsky-Rosen (EPR) pairs…
In this paper, a new contract signing protocol is proposed based on the RSA signature scheme. The protocol will allow two parties to sign the same contract and then exchange their digital signatures. The protocol ensures fairness in that it…
Prepare and measure quantum key distribution protocols can be decomposed into two basic steps: delivery of the signals over a quantum channel and distillation of a secret key from the signal and measurement records by classical processing…
Recently, Shi et al. (Phys. Rev. A, 2015) proposed Quantum Oblivious Set Member Decision Protocol (QOSMDP) where two legitimate parties, namely Alice and Bob, play a game. Alice has a secret $k$ and Bob has a set $\{k_1,k_2,\cdots k_n\}$.…
We explicitly show a protocol in which an arbitrary two qubit a|00> + b|01> + c|10> + d|11> is faithfully and deterministically teleported from Alice to Bob. We construct the 16 orthogonal generalized Bell states which can be used to…
In this paper we present the following quantum compression protocol: P : Let $\rho,\sigma$ be quantum states such that $S(\rho || \sigma) = \text{Tr} (\rho \log \rho - \rho \log \sigma)$, the relative entropy between $\rho$ and $\sigma$, is…
In a recent paper (Phys. Rev. Lett. 109, 160501 (2012). arXiv:1201.0849), it is claimed that any quantum protocol for classical two-sided computation between Alice and Bob can be proven completely insecure for Alice if it is secure against…
Using the previously shared Einstein-Podolsky-Rosen pairs, a proposal which can be used to distribute a quantum key and identify the user's identification simultaneously is presented. In this scheme, two local unitary operations and the…
We experimentally demonstrate the transfer of an unknown single-qubit state from Alice to Bob via a two-step discrete-time quantum random walk on a cycle with four vertices on a four-qubit nuclear magnetic resonance quantum processor. The…
The monogamy of entanglement is one of the basic quantum mechanical features, which says that when two partners Alice and Bob are more entangled then either of them has to be less entangled with the third party. Here we qualitatively…
We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has…
Unclonable Encryption, introduced by Gottesman in 2003, is a quantum protocol that guarantees the secrecy of a successfully transferred classical message even when all keys leak at a later time. We propose an Unclonable Encryption protocol…
We present a scheme for hiding bits in Bell states that is secure even when the sharers Alice and Bob are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain…
Quantum communication networks are connected by various devices to achieve communication or distributed computing for users in remote locations. In order to solve the problem of generating temporary session key for secure communication in…
We present a scheme for quantum secure direct communication with quantum encryption. The two authorized users use repeatedly a sequence of the pure entangled pairs (quantum key) shared for encrypting and decrypting the secret message…
We present a protocol for deterministic and highly efficient quantum cryptography with entangled photon pairs in a 4x4-dimentional Hilbert space. Two communicating parties, Alice and Bob first share a both polarization- and path-entangled…
Blind quantum computation is a new secure quantum computing protocol which enables Alice who does not have sufficient quantum technology to delegate her quantum computation to Bob who has a fully-fledged quantum computer in such a way that…
In this paper, we introduce a new quantum bit commitment protocol which is practically secure against entanglement attacks. A general cheating strategy is discussed and shown to be practically ineffective against the proposed approach.