A novel $2$ \& $3$ player scheme for Quantum Direct Communication

• URL: http://arxiv.org/abs/2307.01620v2
• Date: Tue, 10 Dec 2024 00:37:59 GMT
• Title: A novel $2$ \& $3$ player scheme for Quantum Direct Communication
• Authors: Theodore Andronikos, 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 compound system.
• Score: 0.0
• License:
• 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 compound system. The way of encoding the information is the main novelty of this paper and the distinguishing feature compared to previous works in this field. The most critical advantage of this method is that it is easily scalable and extensible because it can be seamlessly generalized to a setting involving three, or even more, players, as demonstrated with the second protocol. This trait can be extremely beneficial when many spatially separated players posses only part the secret information that must be combined and transmitted to Alice, so that she can obtain 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. The proposed protocol doesn't require pre-shared keys or quantum signatures, making it less complicated and more straightforward. Finally, by employing only standard CNOT and Hadamard gates, it offers the important practical advantage of being implementable on contemporary quantum computers, especially in view of the coming era of quantum distributed computing.

Related papers

• A Novel Efficient Multiparty Semi-Quantum Secret Sharing Protocol Using Entangled States for Sharing Specific Bits [0.0]
  This paper develops a novel multi-party SQSS scheme using the quantum property between Bell states to detect eavesdroppers. It employs a fully one-way communication scheme, entirely preventing the Trojan horse attack without costly quantum devices.
  arXiv  Detail & Related papers  (2024-09-08T16:40:56Z)
• 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)
• 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)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• 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)
• Quantum Differentially Private Sparse Regression Learning [132.1981461292324]
  We devise an efficient quantum differentially private (QDP) Lasso estimator to solve sparse regression tasks. Last, we exhibit that the QDP Lasso attains a near-optimal utility bound $tildeO(N-2/3)$ with privacy guarantees.
  arXiv  Detail & Related papers  (2020-07-23T10:50:42Z)

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.