Secure multiparty quantum computation with (only) a strict honest majority

Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith

Research output: Chapter in Book/Report/Conference proceedingConference contribution

57 Citations (Scopus)

Abstract

Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary - that is, how many players must remain honest - in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any [n-1/2] cheaters among n players. Previous protocols for these tasks tolerated [n-1/4] and [n-1/6]cheaters, respectively. The threshold we achieve is tight - even in the classical case, "fair" multiparty computation is not possible if any set of n/2 players can cheat. Our protocols rely on approximate quantum error-correcting codes, which can tolerate a larger fraction of errors than traditional, exact codes. We introduce new families of authentication schemes and approximate codes tailored to the needs of our protocols, as well as new state purification techniques along the lines of those used in fault-tolerant quantum circuits.

Original languageEnglish (US)
Title of host publication47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
Pages249-258
Number of pages10
DOIs
StatePublished - Dec 1 2006
Event47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006 - Berkeley, CA, United States
Duration: Oct 21 2006Oct 24 2006

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Other

Other47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
CountryUnited States
CityBerkeley, CA
Period10/21/0610/24/06

Fingerprint

Quantum computers
Function evaluation
Authentication
Cryptography
Purification
Networks (circuits)

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A., & Smith, A. (2006). Secure multiparty quantum computation with (only) a strict honest majority. In 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006 (pp. 249-258). [4031361] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/FOCS.2006.68
Ben-Or, Michael ; Crépeau, Claude ; Gottesman, Daniel ; Hassidim, Avinatan ; Smith, Adam. / Secure multiparty quantum computation with (only) a strict honest majority. 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. 2006. pp. 249-258 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
@inproceedings{5f5b7b1ea61f450596d60d7722bc0434,
title = "Secure multiparty quantum computation with (only) a strict honest majority",
abstract = "Secret sharing and multiparty computation (also called {"}secure function evaluation{"}) are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary - that is, how many players must remain honest - in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any [n-1/2] cheaters among n players. Previous protocols for these tasks tolerated [n-1/4] and [n-1/6]cheaters, respectively. The threshold we achieve is tight - even in the classical case, {"}fair{"} multiparty computation is not possible if any set of n/2 players can cheat. Our protocols rely on approximate quantum error-correcting codes, which can tolerate a larger fraction of errors than traditional, exact codes. We introduce new families of authentication schemes and approximate codes tailored to the needs of our protocols, as well as new state purification techniques along the lines of those used in fault-tolerant quantum circuits.",
author = "Michael Ben-Or and Claude Cr{\'e}peau and Daniel Gottesman and Avinatan Hassidim and Adam Smith",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/FOCS.2006.68",
language = "English (US)",
isbn = "0769527205",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
pages = "249--258",
booktitle = "47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006",

}

Ben-Or, M, Crépeau, C, Gottesman, D, Hassidim, A & Smith, A 2006, Secure multiparty quantum computation with (only) a strict honest majority. in 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006., 4031361, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 249-258, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, Berkeley, CA, United States, 10/21/06. https://doi.org/10.1109/FOCS.2006.68

Secure multiparty quantum computation with (only) a strict honest majority. / Ben-Or, Michael; Crépeau, Claude; Gottesman, Daniel; Hassidim, Avinatan; Smith, Adam.

47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. 2006. p. 249-258 4031361 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Secure multiparty quantum computation with (only) a strict honest majority

AU - Ben-Or, Michael

AU - Crépeau, Claude

AU - Gottesman, Daniel

AU - Hassidim, Avinatan

AU - Smith, Adam

PY - 2006/12/1

Y1 - 2006/12/1

N2 - Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary - that is, how many players must remain honest - in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any [n-1/2] cheaters among n players. Previous protocols for these tasks tolerated [n-1/4] and [n-1/6]cheaters, respectively. The threshold we achieve is tight - even in the classical case, "fair" multiparty computation is not possible if any set of n/2 players can cheat. Our protocols rely on approximate quantum error-correcting codes, which can tolerate a larger fraction of errors than traditional, exact codes. We introduce new families of authentication schemes and approximate codes tailored to the needs of our protocols, as well as new state purification techniques along the lines of those used in fault-tolerant quantum circuits.

AB - Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly. This paper investigates how much trust is necessary - that is, how many players must remain honest - in order for distributed quantum computations to be possible. We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any [n-1/2] cheaters among n players. Previous protocols for these tasks tolerated [n-1/4] and [n-1/6]cheaters, respectively. The threshold we achieve is tight - even in the classical case, "fair" multiparty computation is not possible if any set of n/2 players can cheat. Our protocols rely on approximate quantum error-correcting codes, which can tolerate a larger fraction of errors than traditional, exact codes. We introduce new families of authentication schemes and approximate codes tailored to the needs of our protocols, as well as new state purification techniques along the lines of those used in fault-tolerant quantum circuits.

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

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

U2 - 10.1109/FOCS.2006.68

DO - 10.1109/FOCS.2006.68

M3 - Conference contribution

AN - SCOPUS:38149107872

SN - 0769527205

SN - 9780769527208

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 249

EP - 258

BT - 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006

ER -

Ben-Or M, Crépeau C, Gottesman D, Hassidim A, Smith A. Secure multiparty quantum computation with (only) a strict honest majority. In 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. 2006. p. 249-258. 4031361. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/FOCS.2006.68