dorsal/arxiv
View SchemaSecure Multi-party Quantum Computing
| Authors | Claude Crepeau, Daniel Gottesman, Adam Smith |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0206138 |
| URL | https://arxiv.org/abs/quant-ph/0206138 |
Abstract
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.
{
"annotation_id": "f3faf09e-992f-4552-ba0a-d66674a4ed4e",
"date_created": "2026-03-02T18:01:52.919000Z",
"date_modified": "2026-03-02T18:01:52.919000Z",
"file_hash": "315e559c5f67f501e3df9d8e0d641f3bd8318a2826b8eb04632ea2f36be2fe19",
"private": false,
"record": {
"abstract": "Secure multi-party computing, also called \"secure function evaluation\", has\nbeen extensively studied in classical cryptography. We consider the extension\nof this task to computation with quantum inputs and circuits. Our protocols are\ninformation-theoretically secure, i.e. no assumptions are made on the\ncomputational power of the adversary. For the weaker task of verifiable quantum\nsecret sharing, we give a protocol which tolerates any t \u003c n/4 cheating parties\n(out of n). This is shown to be optimal. We use this new tool to show how to\nperform any multi-party quantum computation as long as the number of dishonest\nplayers is less than n/6.",
"arxiv_id": "quant-ph/0206138",
"authors": [
"Claude Crepeau",
"Daniel Gottesman",
"Adam Smith"
],
"categories": [
"quant-ph"
],
"title": "Secure Multi-party Quantum Computing",
"url": "https://arxiv.org/abs/quant-ph/0206138"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "d0743259-d1f0-410e-a5f2-377024b4cfea",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}