Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9711026

Secure Multi-Party Addition via Quantum States

Adrian Kent

Published Nov 17, 1997• 0 citations
arXivHTMLPDF

Abstract

This paper was withdrawn on 20.11.97.
DOI
10.48550/arxiv.quant-ph/9711026

Related papers

Unconditionally Secure Multi-Party Computation

Adrian Kent

This paper was withdrawn on 20.11.97.

arXiv:quant-ph/9711024•Nov 16, 1997•3 citations

Secure Two-Party Computation in a Quantum World

Niklas Büscher, Daniel Demmler, Nikolaos P. Karvelas +5 more

Lecture notes in computer science•Jan 1, 2020•16 citations

Quantum Secure Multi-Party Summation with Graph State

Yaohua Lu, Gangyi Ding

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.

Entropy•Jan 17, 2024•15 citations

An Efficient Semi-Quantum Secure Multi-Party Summation Protocol and Its Applications

Yang Diedie, Cheng Yuan, Chen Jv

International Conference on Advanced Computer Theory and Engineering•Sep 26, 2025•0 citations

Research on Secure Multi-Party Closest String Problem

Wen Liu, Yongbin Wang, Yizhen Cao

A secure two-party hamming distance computing protocol is proposed based on the secure two-party matrix product protocol; a secure four-party addition protocol, a secure three-party addition protocol and a secure two-party number protocol are proposed based on the additive homomorphic encryption and secure two-party compare protocol. A secure multi-party closest string protocol is presented based on the secure two-party hamming distance computing protocol and a secure multi-party addition protocol. These protocols are based on semi-honest model.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2011•0 citations

Quantum protocols for secure multi-party summation

Zhaoxu Ji, Huanguo Zhang, Houzhen Wang +3 more

Quantum Information Processing•Apr 20, 2019•68 citations
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.
A secure two-party hamming distance computing protocol is proposed based on the secure two-party matrix product protocol; a secure four-party addition protocol, a secure three-party addition protocol and a secure two-party number protocol are proposed based on the additive homomorphic encryption and secure two-party compare protocol. A secure multi-party closest string protocol is presented based on the secure two-party hamming distance computing protocol and a secure multi-party addition protocol. These protocols are based on semi-honest model.