A 2 & 3 Player Scheme for Quantum Direct Communication
- URL: http://arxiv.org/abs/2307.01620v1
- Date: Tue, 4 Jul 2023 10:16:17 GMT
- Title: A 2 & 3 Player Scheme for Quantum Direct Communication
- Authors: Theodore Andronikos and Alla Sirokofskich
- Abstract summary: Two protocols achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case.
Both protocols use the same novel method to embed the secret information in the entangled composite system of the players.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper introduces two information-theoretically secure protocols that
achieve quantum secure direct communication between Alice and Bob in the first
case, and among Alice, Bod and Charlie in the second case. Both protocols use
the same novel method to embed the secret information in the entangled
composite system of the players. The way of encoding the information is the
main novelty of this paper and the distinguishing feature compared to previous
works in the field. The advantage of this method is that it is easily
extensible and can be generalized to a setting involving three, or even more,
players, as demonstrated with the second protocol. This trait can be beneficial
when two spatially separated players posses only part of the secret information
that must be combined and transmitted to Alice in order for her to reveal the
complete secret. Using the three player protocol, this task can be achieved in
one go, without the need to apply a typical QSDC protocol twice, where Alice
first receives Bob's information and afterwards Charlie's information. Another
characteristic of both protocols is their simplicity and uniformity. The two
player protocol relies on EPR pairs, and the three player protocol on GHZ
triples, which can be easily prepared with our current technology. In the same
vein, the local quantum circuits are similar or identical, and are easily
constructible as they employ only Hadamard and CNOT gates.
Related papers
- Quantum cloning transformation unlocks the potential of W class of states in a secret sharing protocol [0.0]
We introduce a quantum secret sharing protocol exploiting a three-qubit W class of state shared between three parties.
We find that the protocol is probabilistic and have calculated the probability of success of the protocol.
Even a less entangled W class of state can also play a vital role in the proposed secret-sharing scheme.
arXiv Detail & Related papers (2024-08-13T08:27:58Z) - A Multiparty Quantum Private Equality Comparison scheme relying on $\ket{ GHZ_{ 3 } }$ states [0.0]
This paper introduces an innovative entanglement-based protocol that accomplishes multiparty quantum private comparison.
It is made possible because the protocol uses only GHZ3 triplets, irrespective of the number of millionaires.
The protocol is information-theoretically secure, preventing outside parties from learning about fortunes or inside players from knowing each other's secret numbers.
arXiv Detail & Related papers (2024-07-07T14:21:22Z) - Batch Selection and Communication for Active Learning with Edge Labeling [54.64985724916654]
Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD)
This work introduces Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD)
arXiv Detail & Related papers (2023-11-14T10:23:00Z) - One-to-Many Simultaneous Secure Quantum Information Transmission [0.0]
This paper presents a new quantum protocol designed to simultaneously transmit information from one source to many recipients.
The proposed protocol is completely distributed and is provably information-theoretically secure.
arXiv Detail & Related papers (2023-11-05T00:41:55Z) - Quantum advantage in a unified scenario and secure detection of
resources [55.2480439325792]
We consider a single task to study different approaches of having quantum advantage.
We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
arXiv Detail & Related papers (2023-09-22T23:06:20Z) - Non-interactive XOR quantum oblivious transfer: optimal protocols and
their experimental implementations [0.0]
Oblivious transfer (OT) is an important cryptographic primitive.
We present an optimal protocol, which outperforms classical protocols.
We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
arXiv Detail & Related papers (2022-09-22T20:28:39Z) - Large payload bidirectional quantum secure direct communication without
information leakage [0.0]
Two remote authorized parties, Alice and Bob, can safely exchange their individual secret messages without worrying about the information leakage problem.
Our protocol uses a shared secret GHZ state to overcome the information leakage problem.
arXiv Detail & Related papers (2022-05-05T02:02:51Z) - Quantum cryptography with classical communication: parallel remote state
preparation for copy-protection, verification, and more [125.99533416395765]
Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob.
We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem.
This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
arXiv Detail & Related papers (2022-01-31T18:56:31Z) - Quantum secure direct communication with private dense coding using
general preshared quantum state [59.99354397281036]
We study secure direct communication by using a general preshared quantum state and a generalization of dense coding.
For a practical application, we propose a concrete protocol and derive an upper bound of information leakage.
arXiv Detail & Related papers (2021-12-30T16:12:07Z) - Quantum Private Information Retrieval for Quantum Messages [71.78056556634196]
Quantum private information retrieval (QPIR) for quantum messages is the protocol in which a user retrieves one of the multiple quantum states from one or multiple servers without revealing which state is retrieved.
We consider QPIR in two different settings: the blind setting, in which the servers contain one copy of the message states, and the visible setting, in which the servers contain the description of the message states.
arXiv Detail & Related papers (2021-01-22T10:28:32Z) - Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.
We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries.
We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
arXiv Detail & Related papers (2020-10-15T17:55:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.