Multi-party Quantum Private Comparison Based on the Entanglement Swapping of d-level Cat States and d-level Bell states

• URL: http://arxiv.org/abs/2205.04627v1
• Date: Tue, 10 May 2022 02:14:18 GMT
• Title: Multi-party Quantum Private Comparison Based on the Entanglement Swapping of d-level Cat States and d-level Bell states
• Authors: Zhao-Xu Ji, Tian-Yu Ye
• Abstract summary: In our protocol, n parties employ unitary operations to encode their private secrets and can compare the equality of their private secrets within one time execution of the protocol. One party cannot obtain other parties' secrets except for the case that their secrets are identical. The semi-honest TP cannot learn any information about these parties' secrets except the end comparison result on whether all private secrets from n parties are equal.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, a novel multi-party quantum private comparison (MQPC) protocol with a semi-honest third party (TP) is proposed based on the entanglement swapping of d-level cat states and d-level Bell states. Here, TP is allowed to misbehave on his own but will not conspire with any party. In our protocol, n parties employ unitary operations to encode their private secrets and can compare the equality of their private secrets within one time execution of the protocol. Our protocol can withstand both the outside attacks and the participant attacks on the condition that none of the QKD methods is adopted to generate keys for security. One party cannot obtain other parties' secrets except for the case that their secrets are identical. The semi-honest TP cannot learn any information about these parties' secrets except the end comparison result on whether all private secrets from n parties are equal.

Related papers

• Differential Privacy on Trust Graphs [54.55190841518906]
  We study differential privacy (DP) in a multi-party setting where each party only trusts a (known) subset of the other parties with its data. We give a DP algorithm for aggregation with a much better privacy-utility trade-off than in the well-studied local model of DP.
  arXiv  Detail & Related papers  (2024-10-15T20:31:04Z)
• Unclonable Secret Sharing [18.564937506648622]
  Unclonable cryptography utilizes the principles of quantum mechanics to addresses cryptographic tasks that are impossible classically. We introduce a novel unclonable primitive in the context of secret sharing, called unclonable secret sharing (USS)
  arXiv  Detail & Related papers  (2024-06-16T16:50:15Z)
• Quantum Private Membership Aggregation [35.16231062731263]
  We consider the problem of private set membership aggregation of $N$ parties by using an entangled quantum state. We propose an encoding algorithm that maps the classical information into distinguishable quantum states, along with a decoding algorithm that exploits the distinguishability of the mapped states.
  arXiv  Detail & Related papers  (2024-01-29T18:32:19Z)
• 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)
• Two-party secure semiquantum summation against the collective-dephasing noise [3.312385039704987]
  The term'semi-honest' implies that TP cannot conspire with others but is able to implement all kinds oof attacks. This protocol employs logical qubits as traveling particles to overcome the negative influence of collective-dephasing noise. The security analysis turns out that this protocol can effectively prevent the outside attacks from Eve and the participant attacks from TP.
  arXiv  Detail & Related papers  (2022-05-15T01:10:20Z)
• Circular multi-party quantum private comparison with n-level single-particle states [0.0]
  MQPC protocol can overcome both the outside attack and the participant attack. Each party's secret can be kept unknown to other parties and the third party.
  arXiv  Detail & Related papers  (2022-05-13T23:43:21Z)
• Multi-party quantum private comparison of size relation with d-level single-particle states [0.0]
  Two novel multi-party quantum private comparison protocols for size relation comparison are constructed, respectively. Each protocol can compare the size relation of secret integers from n parties rather than just the equality within one time execution.
  arXiv  Detail & Related papers  (2022-05-13T00:34:52Z)
• Secure multi-party quantum summation based on quantum Fourier transform [0.0]
  The proposed protocol can resist both the outside attacks and the participant attacks. One party cannot obtain other parties' private integer strings; and it is secure for the colluding attack performed by at most n-2 parties, where n is the number of parties.
  arXiv  Detail & Related papers  (2022-05-12T14:36:18Z)
• 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)
• CaPC Learning: Confidential and Private Collaborative Learning [30.403853588224987]
  We introduce Confidential and Private Collaborative (CaPC) learning, the first method provably achieving both confidentiality and privacy in a collaborative setting. We demonstrate how CaPC allows participants to collaborate without having to explicitly join their training sets or train a central model.
  arXiv  Detail & Related papers  (2021-02-09T23:50:24Z)
• 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.