Secure multi-party quantum computation

Claude Crépeau, Daniel Gottesman, Adam Davison Smith

Research output: Contribution to journalConference article

62 Citations (Scopus)

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
StatePublished - Sep 23 2002
EventProceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada
Duration: May 19 2002May 21 2002

Fingerprint

Quantum computers
Function evaluation
Cryptography
Networks (circuits)

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Crépeau, Claude ; Gottesman, Daniel ; Smith, Adam Davison. / Secure multi-party quantum computation. In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002 ; pp. 643-652.
@article{bdde55c3b69a41ecb9b59f60b13061c2,
title = "Secure multi-party quantum computation",
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.",
author = "Claude Cr{\'e}peau and Daniel Gottesman and Smith, {Adam Davison}",
year = "2002",
month = "9",
day = "23",
language = "English (US)",
pages = "643--652",
journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
issn = "0734-9025",
publisher = "Association for Computing Machinery (ACM)",

}

Secure multi-party quantum computation. / Crépeau, Claude; Gottesman, Daniel; Smith, Adam Davison.

In: Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 23.09.2002, p. 643-652.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Secure multi-party quantum computation

AU - Crépeau, Claude

AU - Gottesman, Daniel

AU - Smith, Adam Davison

PY - 2002/9/23

Y1 - 2002/9/23

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036038683&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036038683&partnerID=8YFLogxK

M3 - Conference article

SP - 643

EP - 652

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SN - 0734-9025

ER -