The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2006)
Berkeley, California
Oct. 21, 2006 to Oct. 24, 2006
ISSN: 0272-5428
ISBN: 0-7695-2720-5
pp: 249-260
Avinatan Hassidim , The Hebrew University, Israel
Daniel Gottesman , Perimeter Institute for Theoretical Physics, Canada
Adam Smith , Weizmann Institute of Science, Israel
Michael Ben-Or , The Hebrew University, Israel
Claude Crepeau , McGill University, Canada
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. <p>We present a verifiable quantum secret sharing (VQSS) protocol, and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any \left[ {\frac{{n - 1}} {2}} \right] cheaters among n players. Previous protocols for these tasks tolerated \left[ {\frac{{n - 1}} {4}} \right] and \left[ {\frac{{n - 1}} {6}} \right] 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.</p> <p>Our protocols rely on approximate quantum errorcorrecting 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 faulttolerant quantum circuits.</p>
Avinatan Hassidim, Daniel Gottesman, Adam Smith, Michael Ben-Or, Claude Crepeau, "Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 249-260, 2006, doi:10.1109/FOCS.2006.68
95 ms
(Ver 3.1 (10032016))