Semiquantum proxy blind signature based on quantum teleportation

• URL: http://arxiv.org/abs/2310.19327v1
• Date: Mon, 30 Oct 2023 07:56:29 GMT
• Title: Semiquantum proxy blind signature based on quantum teleportation
• Authors: Xiao Tan, Tian-Yu Ye
• Abstract summary: We propose a novel semiquantum proxy blind signature scheme with quantum teleportation based on X states. Our protocol not only has complete blindness, unforgeability, non-repudiation and but also can resist the attack behavior from an eavesdropper.
• Score: 12.725520944579554
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we propose a novel semiquantum proxy blind signature scheme with quantum teleportation based on X states, where the original message owner, the proxy signer and the third party are quantum participants with complete quantum capabilities, while the original signer and the signature verifier are semiquantum participants with limited quantum capabilities. It turns out that our protocol not only has complete blindness, unforgeability, non-repudiation and but also can resist the attack behavior from an eavesdropper. Compared with many previous quantum proxy blind signature protocols, our protocol may need less quantum resources and be easier to implement in reality, since both the original signer and the signature verifier are semiquantum participants with limited quantum capabilities.

Related papers

• Secured Quantum Identity Authentication Protocol for Quantum Networks [2.3317857568404032]
  This paper proposes a quantum identity authentication protocol that protects quantum networks from malicious entanglements. Unlike the existing protocols, the proposed quantum authentication protocol does not require periodic refreshments of the shared secret keys.
  arXiv  Detail & Related papers  (2023-12-10T05:36:49Z)
• 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)
• Two-Server Oblivious Transfer for Quantum Messages [71.78056556634196]
  We propose two-server oblivious transfer protocols for quantum messages. Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.
  arXiv  Detail & Related papers  (2022-11-07T05:12:24Z)
• 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)
• Three-party secure semiquantum summation without entanglement among quantum user and classical users [15.220708214434984]
  A three-party secure semiquantum summation protocol can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants. This protocol needs none of quantum entanglement swapping, the unitary operation or a pre-shared private key.
  arXiv  Detail & Related papers  (2022-05-15T01:22:10Z)
• 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)
• Benchmarking of Quantum Protocols [0.9176056742068812]
  We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
  arXiv  Detail & Related papers  (2021-11-03T21:17:04Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States [0.0]
  We provide a protocol to prove advanced properties on a received quantum state non-destructively and non-interactively. We show how to create a multi-qubits state from a single superposition. We generalize these results to a multi-party setting and prove that multiple parties can anonymously distribute a GHZ state.
  arXiv  Detail & Related papers  (2021-04-10T11:34:40Z)
• 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)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.