Secure multi-party quantum computation with a dishonest majority

DOI10.1007/978-3-030-45727-3_25MaRDI QIDQ2055679zbMATH OpenOpenAlexFDO

Authors Yfke Dulek, Stacey Jeffery, Christian Majenz, Christian Schaffner, Alex Bredariol Grilo

Publication date 1 December 2021

Full work available at URL https://arxiv.org/abs/1909.13770, https://ir.cwi.nl/pub/29345

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Abstract: The cryptographic task of secure multi-party (classical) computation has received a lot of attention in the last decades. Even in the extreme case where a computation is performed between $k$ mutually distrustful players, and security is required even for the single honest player if all other players are colluding adversaries, secure protocols are known. For quantum computation, on the other hand, protocols allowing arbitrary dishonest majority have only been proven for $k=2$. In this work, we generalize the approach taken by Dupuis, Nielsen and Salvail (CRYPTO 2012) in the two-party setting to devise a secure, efficient protocol for multi-party quantum computation for any number of players $k$, and prove security against up to $k-1$ colluding adversaries. The quantum round complexity of the protocol for computing a quantum circuit of $mathsfCNOT,T$ depth $d$ is $O(kcdot(d+logn))$, where $n$ is the security parameter. To achieve efficiency, we develop a novel public verification protocol for the Clifford authentication code, and a testing protocol for magic-state inputs, both using classical multi-party computation.

Recommendations

• Improved secure multiparty computation with a dishonest majority via quantum means
• Secure quantum computation with classical communication
• Secure multi-party computation with a quantum manner
• Round efficient secure multiparty quantum computation with identifiable abort
• An efficient protocol for the secure multi-party quantum summation

Cites work

• \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
• Actively secure two-party evaluation of any quantum operation
• Efficient simulation for quantum message authentication
• Multiparty Computation from Somewhat Homomorphic Encryption
• Overdrive: making SPDZ great again
• Secure multi-party quantum computation
• Secure multiparty computation and secret sharing
• Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
• Semi-homomorphic encryption and multiparty computation
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Zero-knowledge proofs from secure multiparty computation

Cited in

(24)

• Improved secure multiparty computation with a dishonest majority via quantum means
• Rational protocol of quantum secure multi-party computation
• Post-quantum multi-party computation
• Oblivious transfer is in MiniQCrypt
• Quantum Byzantine agreement for any number of dishonest parties
• A \((k, n)\)-threshold dynamic quantum secure multiparty multiplication protocol
• On the round complexity of secure quantum computation
• Round efficient secure multiparty quantum computation with identifiable abort
• One-way functions imply secure computation in a quantum world
• Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform
• Secure quantum computation with classical communication
• Instantaneous non-local computation of low T-depth quantum circuits
• Secure multi-party computation with a quantum manner
• Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
• On concurrent multi-party quantum computation
• Cryptography with certified deletion
• Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
• Two-round concurrent 2PC from sub-exponential LWE
• Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
• Unconditionally secure commitments with quantum auxiliary inputs
• Authentication of continuous-variable quantum messages
• Round-efficient composable two-party quantum computation
• The black-box simulation barrier persists in a fully quantum world
• An efficient combination of quantum error correction and authentication

This page was built for publication: Secure multi-party quantum computation with a dishonest majority

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055679)