Permutation attack and counterattack on the two-party quantum key agreement over a collective noisy channel

• URL: http://arxiv.org/abs/2009.06871v1
• Date: Tue, 15 Sep 2020 05:27:39 GMT
• Title: Permutation attack and counterattack on the two-party quantum key agreement over a collective noisy channel
• Authors: Jun Gu, Tzonelih Hwang
• Abstract summary: 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.
• Score: 0.20767168898581634
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, Yang et al. (Quantum Inf Process 18, 74, 2019) proposed a two-party quantum key agreement protocol over a collective noisy channel. They claimed that their quantum key agreement protocol can ensure both of the participants have equal influence on the final shared key. However, 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.

Related papers

• Dynamic Quantum Group Key Agreement via Tree Key Graphs [36.47236890715043]
  We propose two dynamic Quantum Group Key Agreement protocols for a join or leave request in group communications. The number of qubits required per join or leave only increases logarithmically with the group size.
  arXiv  Detail & Related papers  (2023-12-07T07:45:59Z)
• 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)
• Phase-Matching Quantum Key Distribution without Intensity Modulation [25.004151934190965]
  We propose a phase-matching quantum key distribution protocol without intensity modulation. Simulation results show that the transmission distance of our protocol could reach 305 km in telecommunication fiber. Our protocol provides a promising solution for constructing quantum networks.
  arXiv  Detail & Related papers  (2023-03-21T04:32:01Z)
• Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• 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)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• 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)
• 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)
• Two attacks and counterattacks on the mutual semi-quantum key agreement protocol using Bell states [0.20767168898581634]
  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.
  arXiv  Detail & Related papers  (2020-10-07T07:44:50Z)
• 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)
• Tight finite-key analysis for generalized high-dimensional quantum key distribution [23.578892457164933]
  We propose a tight finite-key analysis suitable for generalized high-dimensional quantum key distribution protocols. Benefitting from our theory, high-dimensional quantum key distribution protocols with finite resources become experimentally feasible.
  arXiv  Detail & Related papers  (2020-08-08T12:33:53Z)
• Secure multiparty quantum key agreement against collusive attacks [0.0]
  Quantum key agreement enables remote participants to fairly establish a secure shared key based on their private inputs. In the circular-type multiparty quantum key agreement mode, two or more malicious participants can collude together to steal private inputs of honest participants. In this work, we focus on a powerful collusive attack strategy in which two or more malicious participants in particular positions, can learn sensitive information or generate the final key alone.
  arXiv  Detail & Related papers  (2020-04-24T13:27:15Z)

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.