{
  "annotation_id": "73ed2fbf-12c0-4474-a91e-4376fbdb91cb",
  "date_created": "2026-03-02T18:02:44.479000Z",
  "date_modified": "2026-03-02T18:02:44.479000Z",
  "file_hash": "3f7a3db179d02844fd5d276e5634f75a9f90886bd6983fb05a9aa2354eb04f28",
  "private": false,
  "record": {
    "abstract": "I construct a secure multi-party scheme to compute a classical function by a\nsuccinct use of a specially designed fault-tolerant random polynomial quantum\nerror correction code. This scheme is secure provided that (asymptotically)\nstrictly greater than five-sixths of the players are honest. Moreover, the\nsecurity of this scheme follows directly from the theory of quantum error\ncorrecting code, and hence is valid without any computational assumption. I\nalso discuss the quantum-classical complexity-security tradeoff in secure\nmulti-party computation schemes and argue why a full-blown quantum code is\nnecessary in my scheme.",
    "arxiv_id": "quant-ph/9901024",
    "authors": [
      "H. F. Chau"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.61.032308",
    "title": "Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party   Computation",
    "url": "https://arxiv.org/abs/quant-ph/9901024"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f4fbc9a5-8e4c-49b1-b275-95f04d27682f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}