Two-party secure semiquantum summation against the collective-dephasing noise
Tian-Yu Ye, Tian-Jie Xu, Mao-Jie Geng, Ying Chen

TL;DR
This paper introduces a secure two-party semiquantum summation protocol resilient to collective-dephasing noise, enabling private binary sequence summation with a semi-honest quantum third party without pre-shared keys.
Contribution
It presents a novel semiquantum protocol that overcomes collective-dephasing noise and does not require pre-shared keys, enhancing secure quantum summation methods.
Findings
Protocol effectively prevents outside and participant attacks.
TP cannot learn the summation results.
Employs logical qubits to combat collective-dephasing noise.
Abstract
In this paper, we propose a two-party semiquantum summation protocol, where two classical users can accomplish the summation of their private binary sequences with the assistance of a quantum semi-honest third party (TP). 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 and needn't make any two parties pre-share a random secret key. The security analysis turns out that this protocol can effectively prevent the outside attacks from Eve and the participant attacks from TP. Moreover, TP has no knowledge about the summation results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
