<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05865904</id>
  <dt>j</dt>
  <an>05865904</an>
  <augroup>
    <au>Li, Qin</au>
    <au>Long, Dong Yang</au>
    <au>Chan, W.H.</au>
    <au>Qiu, Dao Wen</au>
  </augroup>
  <ti>Sharing a quantum secret without a trusted party.</ti>
  <so>Quantum Inf. Process. 10, No. 1, 97-106 (2011).</so>
  <py>2011</py>
  <pu>Springer, Dordrecht</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>quantum secret sharing</ut>
    <ut>quantum cryptography</ut>
    <ut>quantum information processing</ut>
    <ut>quantum communication</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s11128-010-0180-3</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In a conventional quantum $(k, n)$ threshold scheme, a trusted party shares a secret quantum state with $n$ participants such that any $k$ of those participants can cooperate to recover the original secret, while fewer than $k$ participants obtain no information about the secret. In this paper we show how to construct a quantum $(k, n)$ threshold scheme without the assistance of a trusted party, who generates and distributes shares among the participants. Instead, each participant chooses his private state and contributes the same to the determination of the final secret quantum state.</ab>
    <rv></rv>
  </abgroup>
</item>