A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states

• URL: http://arxiv.org/abs/2306.12208v1
• Date: Wed, 21 Jun 2023 12:06:58 GMT
• Title: A novel circular semiquantum private comparison protocol of equality without a pre-shared key based on \c{hi}-type states
• Authors: Jiang-Yuan Lian, Tian-Yu Ye
• Abstract summary: We adopt chi-type states to design a novel circular semiquantum private comparison protocol. It can determine the equality of private inputs from two semiquantum users within one round implementation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we adopt \c{hi}-type states to design a novel circular semiquantum private comparison (SQPC) protocol which can determine the equality of private inputs from two semiquantum users within one round implementation under the help of a semi-honest third party (TP) who possesses complete quantum capabilities. Here, it is assumed that the semi-honest TP has the abilities to launch all possible attacks to steal useful information about two semiquantum users' private inputs but cannot conspire with anyone else. The travelling particles go from TP to Alice, Alice to Bob and back from Bob to TP. The security analysis turns out the proposed SQPC protocol can resist both the outside attacks and the inside attacks. The proposed SQPC protocol has no demand for unitary operations. Compared with some existing SQPC protocols of equality with quantum entangled states, the proposed SQPC protocol has some advantages more or less:(1)it requires no pre-shared key among different participants; (2)it doesn't need quantum entanglement swapping; and(3)it employs no delay lines.

Related papers

• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• 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)
• Semiquantum private comparison via cavity QED [8.62421338326666]
  We design the first semiquantum private comparison (SQPC) protocol which is realized via cavity quantum electrodynamics (QED) With the help of a semi-honest third party (TP), the proposed protocol can compare the equality of private inputs from two semiquantum parties who only have limited quantum capabilities.
  arXiv  Detail & Related papers  (2023-09-23T02:02:21Z)
• Measure-resend semi-quantum private comparison without entanglement [0.0]
  Our protocol allows two classical users to compare the equality of their private secrets under the help of a quantum third party. The quantum TP is semi-honest in the sense that he is allowed to misbehave on his own but cannot conspire with either of users.
  arXiv  Detail & Related papers  (2022-05-13T00:43:05Z)
• Semiquantum private comparison based on Bell states without quantum measurements from the classical user [4.4053348026380235]
  We propose a novel semiquantum private comparison protocol based on Bell states. TP is assumed to be semi-honest in the sense that she may take all possible attacks to steal users' private inputs except conspiring with anyone. Our protocol can take advantage over previous SQPC protocols based on Bell states in qubit efficiency.
  arXiv  Detail & Related papers  (2022-05-10T14:32:53Z)
• Quantum private comparison via cavity QED [0.0]
  The proposed protocol adopts two-atom product states rather than entangled states as the initial quantum resource. The qubit efficiency of the proposed protocol is as high as 50%.
  arXiv  Detail & Related papers  (2022-05-09T02:37:06Z)
• 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)
• Single-state semiquantum private comparison based on Bell states [3.312385039704987]
  novel semiquantum private comparison (SQPC) protocol based on single kind of Bell states is proposed. TP is allowed to misbehave on her own but cannot conspire with anyone else.
  arXiv  Detail & Related papers  (2021-11-27T05:48:45Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)
• Post-Quantum Multi-Party Computation [32.75732860329838]
  We study multi-party computation for classical functionalities (in the plain model) with security against malicious-time quantum adversaries. We assume superpolynomial quantum hardness of learning with errors (LWE), and quantum hardness of an LWE-based circular security assumption. Along the way, we develop cryptographic primitives that may be of independent interest.
  arXiv  Detail & Related papers  (2020-05-23T00:42:52Z)

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.