Related papers: One-qubit fingerprinting schemes
Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel. Compared to classical key exchange, it has two main advantages: (i) The key is…
We study the prepare-and-measure scenario in which Alice transmits a quantum system to Bob, who then performs a quantum measurement. The quantum state of the system is unknown to Bob, and the measurement is unknown to Alice. It has recently…
It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…
Alice has made a decision in her mind. While she does not want to reveal it to Bob at this moment, she would like to convince Bob that she is committed to this particular decision and that she cannot change it at a later time. Is there a…
Alice, who does not have any sophisticated quantum technology, delegates her quantum computing to Bob, who has a fully-fledged quantum computer. Can she check whether the computation Bob performs for her is correct? She cannot recalculate…
As a new model for signing quantum message, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show…
Quantum communication addresses the problem of exchanging information across macroscopic distances by employing encryption techniques based on quantum mechanical laws. Here, we advance a new paradigm for secure quantum communication by…
This paper discusses properties of quantum fingerprinting with shared entanglement. Under certain restriction of final measurement, a relation is given between unitary operations of two parties. Then, by reducing to spherical coding…
We propose a new scheme in which perfect transmission of 1-qubit information is achieved with high success using purposefully delayed sharing of non-maximally entangled 2-qubit resource and repeated generalized Bell-state measurements…
The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message…
We consider a two-user secure computation problem in which Alice and Bob communicate interactively in order to compute some deterministic functions of the inputs. The privacy requirement is that each user should not learn any additional…
Fingerprinting techniques are widely used for localization because of their accuracy, especially in the presence of wireless channel noise. However, the fingerprinting techniques require significant storage and running time, which is a…
We investigate the feasibility of quantum seals. A quantum seal is a state provided by Alice to Bob along with information which Bob can use to make a measurement, "break the seal," and read the classical message stored inside. There are…
In the direct communication quantum channels the authorized recipient (Bob) and the non-authorized recipient (Eve) have different abilities for verification of received information. Bob can apply the feedback to commit the sender (Alice) to…
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state. In addition, Alice and Bob can use local operations and authenticated public…
We show that with the fourpartite quantum channel used to teleport an arbitrary two qubit state, we can construct a superdense coding protocol where it is possible to transmit 4 bits of classical information sending only 2 qubits. Alice and…
Oblivious transfer (OT) is an important tool in cryptography. It serves as a subroutine to other complex procedures of both theoretical and practical significance. Common attribute of OT protocols is that one party (Alice) has to send a…
In this paper a central server Charlie has access to a quantum system C and measures it with a POVM $\{\Lambda_x\}$. Alice and Bob are only interested in the partial results $g_A(x)$ respectively $g_B(x)$. Alice, Bob, and Charlie share…
Here, we present the quantum version of a very famous statistical decision problem, whose classical version is counter-intuitive to many. The Monty Hall game can be phrased as a two person game between Alice and Bob. In their pioneering…
Bob hides a ball in one of four drawers. Alice is to locate it. Classically she has to open up to three drawers, quantally just one. The fundamental reason for this quantum speedup is not known. The usual representation of the quantum…