A novel multi-party semiquantum private comparison protocol of size relationship with d-dimensional single-particle states

• URL: http://arxiv.org/abs/2208.14377v1
• Date: Tue, 30 Aug 2022 16:35:55 GMT
• Title: A novel multi-party semiquantum private comparison protocol of size relationship with d-dimensional single-particle states
• Authors: Tian-Yu Ye, Jiang-Yuan Lian
• Abstract summary: This protocol requires the help of one quantum third party (TP) and one classical TP. Neither quantum entanglement swapping nor unitary operations are necessary for implementing this protocol.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: By using d-level single-particle states, the first multi-party semiquantum private comparison (MSQPC) protocol which can judge the size relationship of private inputs from more than two classical users within one execution of protocol is put forward. This protocol requires the help of one quantum third party (TP) and one classical TP, both of whom are allowed to misbehave on their own but cannot conspire with anyone else. Neither quantum entanglement swapping nor unitary operations are necessary for implementing this protocol. TPs are only required to perform d-dimensional single-particle measurements. The correctness analysis validates the accuracy of the compared results. The security analysis verifies that both the outside attacks and the participant attacks can be resisted.

Related papers

• Orthogonal-state-based Measurement Device Independent Quantum Communication [32.244698777387995]
  We propose a new protocol of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping detection. Our protocols leverage fundamentally distinct resources to close the security loopholes linked to measurement devices, while also effectively doubling the distance for secure direct message transmission.
  arXiv  Detail & Related papers  (2024-09-30T15:57:17Z)
• 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)
• An Improved Quantum Private Set Intersection Protocol Based on Hadamard Gates [22.0983572289132]
  We find the participant can deduce the other party's private information, which violates the security requirement of private set computation. In order to solve this problem, an improved private set intersection protocol based on Hadamard gate is proposed.
  arXiv  Detail & Related papers  (2023-10-01T16:21:44Z)
• Multi-party quantum private comparison of size relationship with two third parties based on d-dimensional Bell states [5.12433745864982]
  The proposed MQPC protocol is adaptive forthe case that users want to compare the size relationship of their private integers under the control of two supervisors. The proposed MQPC protocol can be used in the strange user environment, because there are not any communication and pre-shared key between each pair of users.
  arXiv  Detail & Related papers  (2022-10-25T01:15:04Z)
• 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)
• 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)
• Semiquantum Private Comparison of Size Relationship Based on d-level Single-Particle States [3.312385039704987]
  We propose a novel semiquantum private comparison protocol of size relationship based on d-level single-particle states. This protocol takes advantage over it on the aspects of initial quantum resource, TP's measurement operations and TP's knowledge about the comparison results.
  arXiv  Detail & Related papers  (2022-01-13T04:30:09Z)
• 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)
• Counterfactual Concealed Telecomputation [22.577469136318836]
  We devise a distributed blind quantum computation protocol to perform a universal two-qubit controlled unitary operation. It is shown that the protocol is valid for general input states and that single-qubit unitary teleportation is a special case of CCT. The protocol becomes deterministic with simplified circuit implementation if the initial composite state of Alice and Bob is a Bell-type state.
  arXiv  Detail & Related papers  (2020-12-09T10:07:58Z)
• 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)

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.