Two attacks and counterattacks on the mutual semi-quantum key agreement protocol using Bell states

• URL: http://arxiv.org/abs/2010.03241v1
• Date: Wed, 7 Oct 2020 07:44:50 GMT
• Title: Two attacks and counterattacks on the mutual semi-quantum key agreement protocol using Bell states
• Authors: Jun Gu and Tzonelih Hwang
• Abstract summary: The proposed protocol tries to help a quantum participant share a key with a classical participant who just has limited quantum capacities. This study points out that the classical participant can manipulate the final shared key by himself/herself without being detected.
• Score: 0.20767168898581634
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, a mutual semi-quantum key agreement protocol using Bell states is proposed by Yan et al. (Mod. Phys. Lett. A, 34, 1950294, 2019). The proposed protocol tries to help a quantum participant share a key with a classical participant who just has limited quantum capacities. Yan et al. claimed that both the participants have the same influence on the final shared key. However, this study points out that the classical participant can manipulate the final shared key by himself/herself without being detected. To solve this problem, an improved method is proposed here.

Related papers

• Experimental anonymous quantum conferencing [72.27323884094953]
  We experimentally implement the AQCKA task in a six-user quantum network using Greenberger-Horne-Zeilinger (GHZ)-state entanglement. We also demonstrate that the protocol retains an advantage in a four-user scenario with finite key effects taken into account.
  arXiv  Detail & Related papers  (2023-11-23T19:00:01Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• 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)
• Multi-party quantum key agreement protocol with authentication [16.298896422265297]
  A multi-party quantum key agreement protocol with authentication is proposed. Classical hash function and Hadamard operation are utilized to authenticate the identity of participants. The security of this protocol against common attacks is analyzed.
  arXiv  Detail & Related papers  (2021-03-23T01:12:55Z)
• On the lightweight authenticated semi-quantum key distribution protocol without Trojan horse attack [0.20767168898581634]
  We propose a lightweight authenticated semi-quantum key distribution protocol for a quantum participant to share a secret key with a classical participant. An attacker can use a modification attack to make both participants share a wrong key without being detected.
  arXiv  Detail & Related papers  (2020-10-20T12:58:47Z)
• Collusion attack and counterattack on the quantum key agreement via non-maximally entangled cluster states [0.20767168898581634]
  Li et al. proposed a multiparty quantum key agreement protocol via non-maximally entangled cluster states. This study points out a loophole that makes Li et al.'s protocol suffer from a collusion attack.
  arXiv  Detail & Related papers  (2020-10-20T04:21:01Z)
• 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)
• Double C-NOT attack on a single-state semi-quantum key distribution protocol and its improvement [0.20767168898581634]
  An eavesdropper can use a double C-NOT attack to obtain parts of the final shared key without being detected by the participants. This study shows that an eavesdropper can use a double C-NOT attack to obtain parts of the final shared key without being detected by the participants.
  arXiv  Detail & Related papers  (2020-09-26T08:29:26Z)
• Permutation attack and counterattack on the two-party quantum key agreement over a collective noisy channel [0.20767168898581634]
  This study shows that the participant who announces the permutation operation can manipulate the final shared key by himself/herself without being detected by the other. To avoid this loophole, an improvement is proposed here.
  arXiv  Detail & Related papers  (2020-09-15T05:27:39Z)

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.