Quantum Privacy-preserving Two-party Circle Intersection Protocol Based
on Phase-encoded Query
- URL: http://arxiv.org/abs/2309.17293v1
- Date: Fri, 29 Sep 2023 14:49:15 GMT
- Title: Quantum Privacy-preserving Two-party Circle Intersection Protocol Based
on Phase-encoded Query
- Authors: Zi-Xian Li, Qi Yang, Bao Feng and Wen-Jie Liu
- Abstract summary: Privacy-preserving geometric intersection (PGI) is an important issue in Secure multiparty computation (SMC)
Phase-encoded query method which has been used in some Quantum SMC protocols is suitable to solve the decision problem.
We use the principle of phase-encoded query to solve an important PGI problem, namely privacy-preserving two-party circle intersection.
- Score: 4.173390013531535
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Privacy-preserving geometric intersection (PGI) is an important issue in
Secure multiparty computation (SMC). The existing quantum PGI protocols are
mainly based on grid coding, which requires a lot of computational complexity.
The phase-encoded query method which has been used in some Quantum SMC
protocols is suitable to solve the decision problem, but it needs to apply high
dimensional Oracle operators. In this paper, we use the principle of
phase-encoded query to solve an important PGI problem, namely
privacy-preserving two-party circle intersection. We study the implementation
of Oracle operator in detail, and achieve polynomial computational complexity
by decompsing it into quantum arithmetic operations. Performance analysis shows
that our protocol is correct and efficient, and can protect the privacy of all
participants against internal and external attacks.
Related papers
- Secure and Efficient Two-party Quantum Scalar Product Protocol With
Application to Privacy-preserving Matrix Multiplication [2.770988618353868]
Two-party quantum scalar product (S2SP) is a promising research area within secure multiparty computation (SMC)
Existing quantum S2SP protocols are not efficient enough, and the complexity is usually close to exponential level.
In this paper, a novel secure two-party quantum scalar product (S2QSP) protocol based on Fourier states is proposed to achieve higher efficiency.
arXiv Detail & Related papers (2023-09-23T14:33:46Z) - Privacy-Preserving Quantum Two-Party Geometric Intersection [12.902590249089023]
An efficient privacy-preserving quantum two-party geometric intersection (PQGI) protocol is proposed.
Compared with classical PGI protocols, our proposed protocol not only has higher security, but also holds lower communication complexity.
arXiv Detail & Related papers (2023-09-22T03:39:01Z) - Secure and Scalable Circuit-based Protocol for Multi-Party Private Set Intersection [4.946124980718068]
Circuit-based approach has advantages over using custom protocols to achieve this task.
By using secure computation between two parties, our protocol sidesteps the complexities associated with multi-party interactions.
In order to mitigate the high overhead associated with circuit-based constructions, we have further enhanced our protocol by utilizing simple hashing scheme and permutation-based hash functions.
arXiv Detail & Related papers (2023-09-14T03:20:33Z) - Secure multiparty quantum computations for greatest common divisor and
private set intersection [2.5204420653245245]
We present a secure multiparty quantum computation (MPQC) for computing greatest common divisor (GCD) based on quantum multiparty private set union (PSU) by Liu, Yang, and Li.
arXiv Detail & Related papers (2023-03-30T07:33:30Z) - A Secure Multiparty Quantum Least Common Multiple Computation Protocol [1.4049484216292827]
We present a secure multiparty computation protocol for least common multiple (LCM) based on Shor's quantum period-finding algorithm (QPA)
Since QPA is a probabilistic algorithm, we also propose a one-vote-down vote protocol based on the existing secure multi-party quantum summation protocol.
arXiv Detail & Related papers (2022-10-15T02:27:18Z) - Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive
Privacy Analysis and Beyond [57.10914865054868]
We consider vertical logistic regression (VLR) trained with mini-batch descent gradient.
We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
arXiv Detail & Related papers (2022-07-19T05:47:30Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Resource Optimisation of Coherently Controlled Quantum Computations with
the PBS-calculus [55.2480439325792]
Coherent control of quantum computations can be used to improve some quantum protocols and algorithms.
We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
arXiv Detail & Related papers (2022-02-10T18:59:52Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.