Secure multiparty quantum computations for greatest common divisor and
private set intersection
- URL: http://arxiv.org/abs/2303.17196v3
- Date: Mon, 3 Apr 2023 21:53:53 GMT
- Title: Secure multiparty quantum computations for greatest common divisor and
private set intersection
- Authors: Muhammad Imran
- Abstract summary: 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.
- Score: 2.5204420653245245
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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. As the first step, we improve the security of the
MPQC protocol for computing least common multiple (LCM) by Liu and Li by
constructing an efficient exact quantum period-finding algorithm (EQPA) as a
subroutine instead of the standard (probabilistic) Shor's quantum
period-finding algorithm (QPA). The use of EQPA instead of the standard QPA
guarantees the correctness of the protocol without repetitions. The improvement
of LCM protocol also improves the private set union protocol which is based on
computing LCM. Finally, using the same idea of the PSU protocol, we construct a
quantum multiparty private set intersection (PSI) by transforming the PSI
problem into the problem of computing GCD. Performance analysis shows that the
correctness and the unconditional security in the semihonest model are
guaranteed directly from the correctness and the security of the subroutine
protocols (LCM and PSU protocols). Moreover, we show that the complexity of the
proposed protocols is polynomial in the size of the secret inputs and the
number of parties.
Related papers
- 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) - Efficient Device-Independent Quantum Key Distribution [4.817429789586127]
Device-independent quantum key distribution (DIQKD) is a key distribution scheme whose security is based on the laws of quantum physics.
We propose an efficient device-independent quantum key distribution protocol in which one participant prepares states and transmits them to another participant.
arXiv Detail & Related papers (2023-11-16T13:01:34Z) - Practical quantum secure direct communication with squeezed states [55.41644538483948]
We report the first table-top experimental demonstration of a CV-QSDC system and assess its security.
This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
arXiv Detail & Related papers (2023-06-25T19:23:42Z) - A Feasible Semi-quantum Private Comparison Based on Entanglement
Swapping of Bell States [5.548873288570182]
We propose a feasible semi-quantum private comparison protocol based on entanglement swapping of Bell states.
Security analysis shows that our protocol is resilient to both external and internal attacks.
Our proposed approach showcases the potential applications of entanglement swapping in the field of semi-quantum cryptography.
arXiv Detail & Related papers (2023-05-12T13:28:44Z) - Asymmetric Quantum Secure Multi-Party Computation With Weak Clients
Against Dishonest Majority [0.0]
We introduce a protocol that lifts classical SMPC to quantum SMPC in a composably and statistically secure way.
Unlike previous quantum SMPC protocols, our proposal only requires very limited quantum resources from all but one party.
arXiv Detail & Related papers (2023-03-15T18:33:18Z) - From Auditable Quantum Authentication to Best-of-Both-Worlds Multiparty
Quantum Computation with Public Verifiable Identifiable Abort [0.5076419064097734]
We construct the first secure multiparty quantum computation with public verifiable identifiable abort (MPQC-PVIA) protocol.
MPQC is the first quantum setting to provide Best-of-Both-Worlds (BoBW) security, which attains full security with an honest majority.
arXiv Detail & Related papers (2022-11-03T09:12:48Z) - 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) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - 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) - 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) - Round-robin differential phase-time-shifting protocol for quantum key
distribution: theory and experiment [58.03659958248968]
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties.
Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments.
We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario.
Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
arXiv Detail & Related papers (2021-03-15T15:20:09Z)
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.