Lightweight Quantum Security Protocols

• URL: http://arxiv.org/abs/2007.05804v2
• Date: Mon, 16 Nov 2020 04:45:45 GMT
• Title: Lightweight Quantum Security Protocols
• Authors: Tzonelih Hwang, Yen-Jie Chen, Chia-Wei Tsai and Cheng-Ching Kuo
• Abstract summary: This paper defines the lightweight quantum security protocols, in which lightweight participants can only operate two out of four very lightweight quantum operations. It proposes a Lightweight Mediated Quantum Key Distribution (LMQKD) protocol as an example to disclose the feasibility and advantage of the lightweight quantum protocol.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Inspired by the semi-quantum protocols, this paper defines the lightweight quantum security protocols, in which lightweight participants can only operate two out of four very lightweight quantum operations. Subsequently, this study proposes a Lightweight Mediated Quantum Key Distribution (LMQKD) protocol as an example to disclose the feasibility and advantage of the lightweight quantum protocol. In the proposed protocol, a dishonest third party (TP) with complete quantum capabilities helps two lightweight quantum users establish a secure key. The lightweight quantum users are allowed to perform only: (1) unitary operations and (2) reflecting qubits without disturbance. The proposed protocol has been showed to be robust under the collective attack.

Related papers

• A Three-Party Lightweight Quantum Key Distribution Protocol in a Restricted Quantum Environment [0.0]
  This study proposes a new lightweight quantum key distribution (LQKD) protocol based on the four-particle cluster state.<n>The protocol enables a quantum-capable user to simultaneously establish two separate secret keys with two "classical" users.
  arXiv  Detail & Related papers  (2025-07-15T10:45:00Z)
• Towards efficient and secure quantum-classical communication networks [47.27205216718476]
  There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC) We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution. We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
  arXiv  Detail & Related papers  (2024-11-01T23:36:19Z)
• 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)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• 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)
• A lightweight three-user secure quantum summation protocol without a third party based on single-particle states [0.0]
  A lightweight three-user secure quantum summation protocol is put forward by using single-particle states. This protocol only requires single-particle states rather than quantum entangled states as the initial quantum resource. Security analysis proves that this protocol is secure against both the outside attacks and the participant attacks.
  arXiv  Detail & Related papers  (2022-04-03T04:58:24Z)
• 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)
• Coherent one-way quantum conference key agreement based on twin field [9.369069713000165]
  Quantum conference key agreement (CKA) enables key sharing among trusted users with information-theoretic security. We propose a quantum CKA protocol of three users. Exploiting coherent states with intensity 0 and $mu$ to encode logic bits, our protocol can break the limit.
  arXiv  Detail & Related papers  (2021-09-06T03:53:08Z)
• Semi-Quantum Inspired Lightweight Mediated Quantum Key Distribution with Limited Resource and Untrusted TP [0.0]
  This paper proposes a semi-quantum inspired lightweight mediated quantum key distribution with limited resource protocol. In this protocol, an untrusted third party (TP) only needs to perform the quantum operations related to single photons.
  arXiv  Detail & Related papers  (2021-03-18T09:45:03Z)
• Multiparty Mediated Quantum Secret Sharing Protocol [0.0]
  The proposed MQSS protocol has addressed two common challenges in the existing semi-quantum secret sharing protocols. The security analysis has delivered proof to show that the proposed MQSS protocol can avoid the collective attack, the collusion attack, and the Trojan horse attacks.
  arXiv  Detail & Related papers  (2021-02-13T02:09:16Z)
• Quantum Key-Distribution Protocols Based on a Quantum Version of the Monty Hall Game [0.0]
  The study proposed two quantum key-distribution protocols based on the quantum version of the Monty Hall game devised by Flitney and Abbott. The motivation behind the second proposal is to simplify a possible physical implementation by adapting the formalism of the qutrit protocol to use qubits and simple logical quantum gates.
  arXiv  Detail & Related papers  (2020-05-11T22:06:30Z)

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.