Efficient Multi-Party Quantum Secret Sharing Schemes

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages

Scientific paper

10.1103/PhysRevA.69.052307

In this work, we generalize the quantum secret sharing scheme of Hillary, Bu\v{z}ek and Berthiaume[Phys. Rev. A59, 1829(1999)] into arbitrary multi-parties. Explicit expressions for the shared secret bit is given. It is shown that in the Hillery-Bu\v{z}ek-Berthiaume quantum secret sharing scheme the secret information is shared in the parity of binary strings formed by the measured outcomes of the participants. In addition, we have increased the efficiency of the quantum secret sharing scheme by generalizing two techniques from quantum key distribution. The favored-measuring-basis Quantum secret sharing scheme is developed from the Lo-Chau-Ardehali technique[H. K. Lo, H. F. Chau and M. Ardehali, quant-ph/0011056] where all the participants choose their measuring-basis asymmetrically, and the measuring-basis-encrypted Quantum secret sharing scheme is developed from the Hwang-Koh-Han technique [W. Y. Hwang, I. G. Koh and Y. D. Han, Phys. Lett. A244, 489 (1998)] where all participants choose their measuring-basis according to a control key. Both schemes are asymptotically 100% in efficiency, hence nearly all the GHZ-states in a quantum secret sharing process are used to generate shared secret information.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-446646

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.