dorsal/arxiv
View SchemaAssisted Quantum Secret Sharing
| Authors | Sudhir Kumar Singh, R. Srikanth |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0407200 |
| URL | https://arxiv.org/abs/quant-ph/0407200 |
Abstract
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 $\lambda-1$ withheld shares are required, where $\lambda$ 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.
{
"annotation_id": "7f889fdf-0eca-4942-b7e2-6069dfd53ed5",
"date_created": "2026-03-02T18:02:10.009000Z",
"date_modified": "2026-03-02T18:02:10.009000Z",
"file_hash": "c85b75616438b5baa02852ee867b89c200bb1171461b15a82d2d9c21fa40609d",
"private": false,
"record": {
"abstract": "A restriction on quantum secret sharing (QSS) that comes from the no-cloning\ntheorem is that any pair of authorized sets in an access structure should\noverlap. From the viewpoint of application, this places an unnatural constraint\non secret sharing. We present a generalization, called assisted QSS (AQSS),\nwhere access structures without pairwise overlap of authorized sets is\npermissible, provided some shares are withheld by the share dealer. We show\nthat no more than $\\lambda-1$ withheld shares are required, where $\\lambda$ is\nthe minimum number of {\\em partially linked classes} among the authorized sets\nfor the QSS. This is useful in QSS schemes where the share dealer is honest by\ndefinition and is equivalent to a secret reconstructor. Our result means that\nsuch applications of QSS need not be thwarted by the no-cloning theorem.",
"arxiv_id": "quant-ph/0407200",
"authors": [
"Sudhir Kumar Singh",
"R. Srikanth"
],
"categories": [
"quant-ph",
"cs.CR",
"math.CO"
],
"title": "Assisted Quantum Secret Sharing",
"url": "https://arxiv.org/abs/quant-ph/0407200"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5bae006c-34b7-48c6-a72e-0236d3e917ec",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}