Circular multi-party quantum private comparison with n-level single-particle states

• URL: http://arxiv.org/abs/2205.06928v2
• Date: Thu, 19 May 2022 23:29:31 GMT
• Title: Circular multi-party quantum private comparison with n-level single-particle states
• Authors: Chong-Qiang Ye, Tian-Yu Ye
• Abstract summary: 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.
• 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 for equality comparison with n-level single-particle states is constructed, where the encoded particles are transmitted in a circular way. Here, n parties employ the qudit shifting operation to encode their private secrets and can compare the equality of their private secrets within one time execution of protocol. The proposed MQPC protocol can overcome both the outside attack and the participant attack. Specially, each party's secret can be kept unknown to other parties and the third party (TP).

Related papers

• 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)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• 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)
• A novel multi-party semiquantum private comparison protocol of size relationship with d-dimensional single-particle states [0.0]
  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.
  arXiv  Detail & Related papers  (2022-08-30T16:35:55Z)
• 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)
• 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)
• 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)
• Multi-party Quantum Private Comparison Based on the Entanglement Swapping of d-level Cat States and d-level Bell states [0.0]
  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.
  arXiv  Detail & Related papers  (2022-05-10T02:14:18Z)
• Differential Secrecy for Distributed Data and Applications to Robust Differentially Secure Vector Summation [32.004283989604154]
  We present a protocol for vector summation that verifies that the Euclidean norm of each contribution is approximately bounded. Unlike SMC algorithms that inevitably cast integers to elements of a large finite field, our algorithms work over integers/reals, which may allow for additional efficiencies.
  arXiv  Detail & Related papers  (2022-02-22T02:06:42Z)
• 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.