Efficient multiparty quantum-secret-sharing schemes

In this work, we generalize the quantum-secret-sharing scheme of Hillery, Bužek, and Berthiaume [<article>Phys. Rev. A 59, 1829 (1999)</article>] into arbitrary multiparties. Explicit expressions for the shared secret bit is given. It is shown that in the Hillery-Buž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 [<eprint>H. K. Lo, H. F. Chau, and M. Ardehali, e-print <eprintid>quant-ph/0011056</eprintid></eprint>] 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 [<article>W. Y. Hwang, I. G. Koh, and Y. D. Han, Phys. Lett. A 244, 489 (1998)</article>] where all participants choose their measuring basis according to a control key. Both schemes are asymptotically 100% in efficiency, hence nearly all the Greenberger-Horne-Zeilinger states in a quantum-secret-sharing process are used to generate shared secret information.