Multi-party quantum private comparison of size relation with d-level single-particle states

• URL: http://arxiv.org/abs/2205.06406v1
• Date: Fri, 13 May 2022 00:34:52 GMT
• Title: Multi-party quantum private comparison of size relation with d-level single-particle states
• Authors: Chong-Qiang Ye, Tian-Yu Ye
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, by using d-level single-particle states, two novel multi-party quantum private comparison protocols for size relation comparison with two semi-honest third parties and one semi-honest third party are constructed, respectively. Here, each protocol can compare the size relation of secret integers from n parties rather than just the equality within one time execution. In each protocol, every third party is assumed to be semi-honest in the sense that she may misbehave on her own but is not allowed to collude with anyone else; and each party employs the qudit shifting operation to encode her secret integer. Each protocol can resist both the outside attack and the participant attack. Specially, each party's secret integer can be kept unknown to other parties and the third parties. The proposed protocol with two third parties is workable in a stranger environment, as there are no communication and no pre-shared key between each pair of party. The proposed protocol with one third party is workable in an acquaintance environment, as all parties need to share a common private key beforehand.

Related papers

• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• 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)
• An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
  We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
  arXiv  Detail & Related papers  (2023-06-15T09:05:36Z)
• 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)
• 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)
• 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)
• German Parliamentary Corpus (GerParCor) [63.17616047204443]
  We introduce the German Parliament Corpus (GerParCor) GerParCor is a genre-specific corpus of German-language parliamentary protocols from three centuries and four countries. All protocols were preprocessed by means of the NLP pipeline of spaCy3 and automatically annotated with metadata regarding their session date.
  arXiv  Detail & Related papers  (2022-04-21T22:06:55Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• MPC-enabled Privacy-Preserving Neural Network Training against Malicious Attack [44.50542274828587]
  We propose an approach for constructing efficient $n$-party protocols for secure neural network training. Our actively secure neural network training incurs affordable efficiency overheads of around 2X and 2.7X in LAN and WAN settings. Besides, we propose a scheme to allow additive shares defined over an integer ring $mathbbZ_N$ to be securely converted to additive shares over a finite field $mathbbZ_Q$.
  arXiv  Detail & Related papers  (2020-07-24T15:03:51Z)

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.