Collusion attack and counterattack on the quantum key agreement via non-maximally entangled cluster states

• URL: http://arxiv.org/abs/2010.10002v1
• Date: Tue, 20 Oct 2020 04:21:01 GMT
• Title: Collusion attack and counterattack on the quantum key agreement via non-maximally entangled cluster states
• Authors: Jun Gu and Tzonelih Hwang
• Abstract summary: 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.
• Score: 0.20767168898581634
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, Li et al. (Int J Theor Phys: DOI: 10.1007/s10773-020-04588-w, 2020) proposed a multiparty quantum key agreement protocol via non-maximally entangled cluster states. They claimed that the proposed protocol can help all the involved participants have equal influence on the final shared key. However, this study points out a loophole that makes Li et al.'s protocol suffer from a collusion attack, i.e. several dishonest participants can conspire to manipulate the final shared key without being detected by others. To avoid this loophole, an improvement is proposed here.

Related papers

• Efficient source-independent quantum conference key agreement [25.617190829449893]
  Quantum conference key agreement (QCKA) enables the unconditional secure distribution of conference keys among multiple participants. We propose a source-independent QCKA scheme utilizing the post-matching method. We introduce an equivalent distributing virtual multi-photon entanglement protocol for providing the unconditional security proof.
  arXiv  Detail & Related papers  (2024-06-25T04:24:06Z)
• 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)
• Improvements on "Multi-Party Quantum Summation without a Third Party based on $d$-Dimensional Bell States" [2.4578723416255754]
  Wu et al. presented a multi-party quantum summation scheme exploiting the entanglement properties of d-dimensional Bell states. It is claimed that their protocol is secure against outside and participants' attacks. However, this work points out that Wu's protocol has a loophole, i.e., two or more dishonest participants who meet a specific location relationship can conspire to obtain the private inputs of some honest participants without being detected.
  arXiv  Detail & Related papers  (2023-07-20T14:30:02Z)
• 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)
• 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)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• 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)
• 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)
• 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.