Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort

Alon, Bar; Chung, Hao; Chung, Kai-Min; Huang, Mi-Ying; Lee, Yi; Shen, Yu-Ching

doi:10.1007/978-3-030-84242-0_16

Cited by 7 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We now compare our result with [9,26,1]. Reference [9] also achieve an informationtheoretic upgrade of a Classical SMPC to the quantum domain, secure against an arbitrary number of corrupted parties.…”

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 90%

“…Table 1 below gives a comparison of our protocol with the peer-to-peer protocols of [9] and [26], and with the more recent semi-delegated protocol of [1]. Appendix J gives a more in-depth analysis, showing that our protocol closes gaps left as open questions in previous results.…”

Section: Introductionmentioning

confidence: 92%

“…The protocol of [26] constructs an information-theoretically secure Quantum SMPC but suffers from an artificial blow-up in the number of participants and exchanged qubits. 18 The protocols of [26,1] are proven secure in the Stand-Alone Model, whereas ours and that of [9] are fully composable. On top of blindness, all protocols provide verifiability with unanimous abort apart from that of [1] who achieves the stronger notion of identifiable abort.…”

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 98%

“…18 The protocols of [26,1] are proven secure in the Stand-Alone Model, whereas ours and that of [9] are fully composable. On top of blindness, all protocols provide verifiability with unanimous abort apart from that of [1] who achieves the stronger notion of identifiable abort. 19 One key advantage of our protocol over the others lies in its delegated nature, where only one participant needs a full fault-tolerant quantum computer while the rest only perform very limited quantum operations, compared with the symmetric setup in [9,26] where all participant has requires fault-tolerance.…”

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 98%

“…Reference [9] also achieve an informationtheoretic upgrade of a Classical SMPC to the quantum domain, secure against an arbitrary number of corrupted parties. On the other hand, the protocol from [1] is only computationally-secure since it relies on a Fully-Homomorphic Encryption Scheme on top of the Classical SMPC, but it is also secure against arbitrary corruptions. The protocol of [26] constructs an information-theoretically secure Quantum SMPC but suffers from an artificial blow-up in the number of participants and exchanged qubits.…”

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 99%

See 4 more Smart Citations

Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds

Kapourniotis¹,

Kashefi²,

Music³

et al. 2021

Preprint

View full text Add to dashboard Cite

Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks through it's ability to preserve privacy and integrity of the highly valuable computations they would enable. Contributing to the latest challenges in this field, we present a composable protocol achieving blindness and verifiability even in the case of a single honest client. The security of our protocol is reduced, in an information-theoretically secure way, to that of a classical composable Secure Multi-Party Computation (SMPC) used to coordinate the various parties. Our scheme thus provides a statistically secure upgrade of such classical scheme to a quantum one with the same level of security. In addition, (i) the clients can delegate their computation to a powerful fully fault-tolerant server and only need to perform single qubit operations to unlock the full potential of multi-party quantum computation; (ii) the amount of quantum communication with the server is reduced to sending quantum states at the beginning of the computation and receiving the output states at the end, which is optimal and removes the need for interactive quantum communication; and (iii) it has a low constant multiplicative qubit overhead compared to the single-client delegated protocol it is built upon. The main technical ingredient of our paper is the bootstraping of the MPQC construction by Double Blind Quantum Computation, a new composable resource for blind multiparty quantum computation, that demonstrates the surprising fact that the full protocol does not require verifiability of all components to achieve security.

show abstract

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 90%

Section: Introductionmentioning

confidence: 92%

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 98%

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 98%

Section: J Performance Analysis and In-depth Comparison With Previous...mentioning

confidence: 99%

See 3 more Smart Citations

Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds

Kapourniotis¹,

Kashefi²,

Music³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

On Concurrent Multi-party Quantum Computation

Goyal¹,

Liang²,

Malavolta

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort

Chung,

Huang,

Tang

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort

Cited by 7 publications

References 15 publications

Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds

Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds

On Concurrent Multi-party Quantum Computation

Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort

Contact Info

Product

Resources

About