Secure multi-party quantum computation

Claude Crépeau, Daniel Gottesman, Adam Smith

Research output: Contribution to journalConference article

75 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)643-652
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 2002
EventProceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada
Duration: May 19 2002May 21 2002

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Secure multi-party quantum computation'. Together they form a unique fingerprint.

  • Cite this