Secure Multi-party Quantum Computing

Abstract

Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this 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.

10 pages. Appeared in the proceedings of STOC 2002. Web reference: http://doi.acm.org/10.1145/509907.510000

References in corpus (2)

• How to share a quantum secret
• Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation

Cited by in corpus (6)

• Towards quantum-based privacy and voting
• Quantum accuracy threshold for concatenated distance-3 codes
• Level Reduction and the Quantum Threshold Theorem
• Hashing protocol for distilling multipartite CSS states
• Private algebras in quantum information and infinite-dimensional complementarity
• Private Quantum Subsystems and Quasiorthogonal Operator Algebras