Three-Party Secure Semiquantum Summation without Entanglement Among Quantum User and Classical Users

@article{Hu2022ThreePartySS,
  title={Three-Party Secure Semiquantum Summation without Entanglement Among Quantum User and Classical Users},
  author={Jia-Li Hu and Tian-Yu Ye},
  journal={International Journal of Theoretical Physics},
  year={2022}
}
  • Jia-Li Hu, Tian-Yu Ye
  • Published 15 May 2022
  • Physics, Computer Science
  • International Journal of Theoretical Physics
: In this paper, a three-party secure semiquantum summation protocol, which can calculate the modulo 2 addition of the private bits from one quantum participant and two classical participants, is constructed by only using single qubits as the initial quantum resource. This protocol needs none of quantum entanglement swapping, the unitary operation or a pre-shared private key. This protocol only requires the quantum participant to perform the   0 , 1 basis measurements, the   , + − basis… 

Tables from this paper

References

SHOWING 1-10 OF 25 REFERENCES
An Efficient Protocol for the Secure Multi-party Quantum Summation
TLDR
A new and efficient quantum protocol which allows a group of mutually distrustful players to perform the summation computation is proposed, utilizing the multi-particle entangled states as the information carriers and code all players’ Bell-basis measurement outcomes into one classical bit.
Secure multi-party quantum summation based on quantum Fourier transform
TLDR
A novel secure multi-party quantum summation protocol based on quantum Fourier transform, where the traveling particles are transmitted in a tree-type mode and implements the calculation of addition in a secret-by-secret way rather than a bit- by-bit way.
Efficient semi-quantum private comparison using single photons
AbstractThis paper proposes an efficient semi-quantum private comparison protocol (SQPC) using single photons, which allows two classical participants to securely compare the equality of their secret
Multi-Party Quantum Summation within a d-Level Quantum System
TLDR
A secure multi-party quantum summation protocol within a d-level quantum system is constructed by using the qudit shifting operation, where the encoded photons are transmitted in a circular way.
Quantum Secure Multiparty Summation Based on the Phase Shifting Operation of d-Level Quantum System and its Application
A quantum secure multiparty summation protocol is constructed based on the phase shifting operation of d-level quantum system which utilizes the integer-by-integer technique to calculate the modulo d
Quantum key distribution in the Holevo limit.
TLDR
It is showed that it can be done by splitting the secret bits between several qubits and forcing Eve to have only a sequential access to the qubits, as proposed by Goldenberg and Vaidman.
High-Capacity Quantum Summation with Single Photons in Both Polarization and Spatial-Mode Degrees of Freedom
In this paper, we employ single photons in both polarization and spatial-mode degrees of freedom to design a quantum summation protocol. We assume that the third party, i.e. TP, is semi-honest in our
Quantum protocols for secure multi-party summation
TLDR
Two quantum secure multi-party summation protocols, both of which allow multiple mutually distrustful parties to securely compute the summation of their secret data, are presented and it is shown that these protocols can resist various attacks from both outside attackers and inside participants.
Secure Multiparty Quantum Computation for Summation and Multiplication
TLDR
This paper presents a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively and can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.
Quantum Key Distribution with Classical Bob
  • Michel Boyer, D. Kenigsberg, T. Mor
  • Computer Science, Mathematics
    2007 First International Conference on Quantum, Nano, and Micro Technologies (ICQNM'07)
  • 2007
TLDR
This work proves that any attempt of an adversary to obtain information necessarily induces some errors that the legitimate users could notice, and presents two protocols with this constraint, and proves their robustness against attacks.
...
...