Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation

Details Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation

1999-01-11

arxiv.org/abs/quant-ph/9901024v2

Physics

Quantum Physics

Greatly expanded and clarified, 10 pages, requires amsfonts

Scientific paper

10.1103/PhysRevA.61.032308

I construct a secure multi-party 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 greater 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 multi-party computation schemes and argue why a full-blown quantum code is necessary in my scheme.

Affiliated with

Also associated with

No associations

Rating

Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-62846