Assisted Quantum Secret Sharing
| dc.creator | Singh, Sudhir Kumar | |
| dc.creator | Srikanth, R. | |
| dc.date | 2004-07-26 | |
| dc.date.accessioned | 2026-07-07T06:10:25Z | |
| dc.date.available | 2026-07-07T06:10:25Z | |
| dc.description | A restriction on quantum secret sharing (QSS) that comes from the no-cloning theorem is that any pair of authorized sets in an access structure should overlap. From the viewpoint of application, this places an unnatural constraint on secret sharing. We present a generalization, called assisted QSS (AQSS), where access structures without pairwise overlap of authorized sets is permissible, provided some shares are withheld by the share dealer. We show that no more than $λ-1$ withheld shares are required, where $λ$ is the minimum number of {\em partially linked classes} among the authorized sets for the QSS. This is useful in QSS schemes where the share dealer is honest by definition and is equivalent to a secret reconstructor. Our result means that such applications of QSS need not be thwarted by the no-cloning theorem. | |
| dc.description | REVTeX4, 4 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0407200 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0407200 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92254 | |
| dc.subject | Quantum Physics | |
| dc.subject | Cryptography and Security | |
| dc.subject | Combinatorics | |
| dc.title | Assisted Quantum Secret Sharing | |
| dc.type | text |