# On The Round Complexity of Two-Party Quantum Computation

@article{Bartusek2020OnTR, title={On The Round Complexity of Two-Party Quantum Computation}, author={James Bartusek and Andrea Coladangelo and Dakshita Khurana and Fermi Ma}, journal={IACR Cryptol. ePrint Arch.}, year={2020}, volume={2020}, pages={1471} }

We investigate the round complexity of maliciously-secure two-party quantum computation (2PQC) with setup, and obtain the following results:
- A three-message protocol (two-message if only one party receives output) in the common random string (CRS) model assuming classical two-message oblivious transfer (OT) with post-quantum malicious security. This round complexity is optimal for the sequential communication setting. Under the additional assumption of reusable malicious designated-verifierâ€¦Â Expand

#### 4 Citations

Constant-round Multi-party Quantum Computation for Constant Parties

- Computer Science, Physics
- 2020

This work proposes the first constant-round multi-party quantum computation protocol for a fixed number of parties against specious adversaries, thereby significantly reducing the required number of rounds. Expand

Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing

- Computer Science
- ArXiv
- 2021

This construction has the so-called dual-mode property, which means that there are two computationally indistinguishable modes of generating CRS, and it has information theoretical soundness in one mode and information theoretical zero-knowledge property in the other. Expand

Rate-1 Secure Function Evaluation for BQP

- 2021

Secure function evaluation (SFE) allows Alice to publish an encrypted version of her input m such that Bob (holding a circuit C) can send a single message that reveals C(m) to Alice, and nothingâ€¦ Expand

Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States

- Computer Science, Physics
- ArXiv
- 2021

This work proposes a different approach, and starts the study of Non-Destructive Zero-Knowledge Proofs on Quantum States, and shows how it can prove useful to distribute a GHZ state between different parties, in such a way that only parties knowing a secret can be part of this GHZ. Expand

#### References

SHOWING 1-10 OF 63 REFERENCES

Post-Quantum Multi-Party Computation in Constant Rounds

- Physics, Computer Science
- ArXiv
- 2020

The first constant-round post-quantum multi-party computation protocol for general classical functionalities in the plain model is obtained, with security against malicious corruptions, and a new straight-line non-black-box simulator against parallel verifiers that does not clone the adversary's state is built. Expand

Founding Cryptography on Oblivious Transfer - Efficiently

- Computer Science
- CRYPTO
- 2008

We present a simple and efficient compiler for transforming secure multi-party computation (MPC) protocols that enjoy security only with an honest majority into MPC protocols that guarantee securityâ€¦ Expand

Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

- Computer Science, Physics
- CRYPTO
- 2010

We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version ofâ€¦ Expand

Non-interactive classical verification of quantum computation

- Physics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2020

This work shows that the interactive protocol Mahadev constructed can in fact be performed non-interactively and in zero-knowledge, and establishes the security of the protocols under standard assumptions in quantum-secure cryptography. Expand

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority

- Mathematics, Computer Science
- 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
- 2006

This paper presents a verifiable quantum secret sharing protocol (VQSS), and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any cheaters among n players. Expand

Multi-theorem (Malicious) Designated-Verifier NIZK for QMA

- Computer Science, Physics
- IACR Cryptol. ePrint Arch.
- 2020

This work presents the first non-interactive zero-knowledge argument system for QMA with multi-theorem security and shows a general transformation that compiles any sigma protocol into a reusable MDV-NIZK protocol, using NIZK for NP. Expand

Two Round Multiparty Computation via Multi-key FHE

- Mathematics, Computer Science
- EUROCRYPT
- 2016

A general multiparty computation MPC protocol with only two rounds of interaction in the common random string model, which is known to be optimal in the honest-but-curious setting and fully malicious setting, is constructed. Expand

Fiat-Shamir: from practice to theory

- Computer Science
- STOC
- 2019

A framework for reducing the security of protocols based on the learning with errors (LWE) problem to qualitatively simpler and weaker computational hardness assumptions is presented. Expand

Secure multi-party quantum computation

- Computer Science
- STOC '02
- 2002

This work uses a new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6 and gives a protocol which tolerates any t Î¾ n/4 cheating parties (out of n). Expand

Why quantum bit commitment and ideal quantum coin tossing are impossible

- Computer Science, Physics
- 1997

It is shown that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. Expand