Secure Multi-party Quantum Computing

Details Secure Multi-party Quantum Computing Secure Multi-party Quantum Computing

2002-06-20

arxiv.org/abs/quant-ph/0206138v1

Physics

Quantum Physics

10 pages. Appeared in the proceedings of STOC 2002. Web reference: http://doi.acm.org/10.1145/509907.510000

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Secure Multi-party Quantum Computing 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 Secure Multi-party Quantum Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Multi-party Quantum Computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330192