Collective attack free controlled quantum key agreement without quantum memory

• URL: http://arxiv.org/abs/2308.05470v1
• Date: Thu, 10 Aug 2023 09:51:23 GMT
• Title: Collective attack free controlled quantum key agreement without quantum memory
• Authors: Arindam Dutta and Anirban Pathak
• Abstract summary: We present a new protocol for controlled quantum key agreement and another protocol for key agreement with a specific focus on the security analysis. Specifically, detailed security proof is provided against impersonated fraudulent attack and collective attacks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Here we present a new protocol for controlled quantum key agreement and another protocol for key agreement with a specific focus on the security analysis. Specifically, detailed security proof is provided against impersonated fraudulent attack and collective attacks and it is established that the proposed protocols are not only secure, but they also satisfy other desired properties of such schemes (i.e., fairness and correctness). Further, the proposed schemes are critically compared with a set of schemes for quantum key agreement and an existing scheme for controlled quantum key agreement (Tang et al.'s protocol) in terms of efficiency and the required quantum resources. Especially, it is observed that in contrast to the existing schemes, the present scheme does not require quantum memory. In addition, the protocol for controlled quantum key agreement proposed here is found to require quantum resources (Bell state and single photon state) that are easier to produce and maintain compared to the quantum resources (GHZ states) required by the only known existing protocol for the same purpose, i.e., Tang et al.'s protocol.

Related papers

• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• 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)
• Efficient Device-Independent Quantum Key Distribution [4.817429789586127]
  Device-independent quantum key distribution (DIQKD) is a key distribution scheme whose security is based on the laws of quantum physics. We propose an efficient device-independent quantum key distribution protocol in which one participant prepares states and transmits them to another participant.
  arXiv  Detail & Related papers  (2023-11-16T13:01:34Z)
• An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol Using Bell States [16.277401577186605]
  Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al. Zhu et al. pointed out that there are some security flaws and proposed an improved version. This study shows the present protocol can guarantee the correctness, security, privacy and fairness of quantum key agreement.
  arXiv  Detail & Related papers  (2023-09-22T09:02:18Z)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• 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)
• New protocols for quantum key distribution with explicit upper and lower bound on secret-key rate [0.0]
  We present two new schemes for quantum key distribution (QKD) which neither require entanglement nor require an ideal single photon source. The proposed protocols can be implemented using realistic single photon sources which are commercially available.
  arXiv  Detail & Related papers  (2022-12-26T11:14:39Z)
• 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)
• 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)
• A short review on quantum identity authentication protocols: How would Bob know that he is talking with Alice? [0.0]
  Successful implementation of a scheme of quantum key distribution (QKD) requires identity authentication as a prerequisite. Several schemes for identity authentication, using quantum resources have been proposed. The security of such protocols is also critically analyzed.
  arXiv  Detail & Related papers  (2021-12-08T11:22:29Z)
• Measure-resend authenticated semi-quantum key distribution with single photons [5.594785248905853]
  A new measure-resend ASQKD protocol is proposed in this paper. The security proof shows the robustness of the proposed protocol under the collective attack.
  arXiv  Detail & Related papers  (2020-06-20T05:03:07Z)

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.