Quantum-classical complexity-security tradeoff in secure multiparty computations
Author:
Open Access
- 16 February 2000
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 61 (3) , 032308
Abstract
I construct a secure multiparty scheme to compute a classical function by a succinct use of a specially designed fault-tolerant random polynomial quantum error correction code. This scheme is secure provided that (asymptotically) strictly more than five-sixths of the players are honest. Moreover, the security of this scheme follows directly from the theory of quantum error correcting code, and hence is valid without any computational assumption. I also discuss the quantum-classical complexity-security tradeoff in secure multiparty computation schemes and argue why a full-blown quantum code is necessary in my scheme.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Unconditional Security of Quantum Key Distribution over Arbitrarily Long DistancesScience, 1999
- Analog Quantum Error CorrectionPhysical Review Letters, 1998
- Error Correction for Continuous Quantum VariablesPhysical Review Letters, 1998
- Substituting quantum entanglement for communicationPhysical Review A, 1997
- Insecurity of quantum secure computationsPhysical Review A, 1997
- Five quantum register error correction code for higher spin systemsPhysical Review A, 1997
- Is Quantum Bit Commitment Really Possible?Physical Review Letters, 1997
- Correcting quantum errors in higher spin systemsPhysical Review A, 1997
- Simple quantum error-correcting codesPhysical Review A, 1996
- Multiple-particle interference and quantum error correctionProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1996