A Quantum Protocol for Secure Manhattan Distance Computation

Wen, Liu; Zhang, Wei

doi:10.1109/access.2020.2966800

Cited by 5 publications

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Schiansky et al [22] implemented a quantum-digital payment system that combines QKD, quantum money, and blockchain technology. Furthermore, more and more researchers have applied quantum techniques to secure multi-party computation fields such as privacy comparison [23][24][25], secure multi-party summation [26][27][28], set intersection and union [29][30][31], Manhattan distance [32], etc.…”

Section: Introductionmentioning

confidence: 99%

Quantum Secure Multi-Party Summation with Graph State

Lu,

Ding

2024

Entropy

View full text Add to dashboard Cite

Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.

show abstract