{
  "annotation_id": "5cd84f48-e204-4ecf-95f9-0963ac3b7b36",
  "date_created": "2026-03-02T18:01:42.591000Z",
  "date_modified": "2026-03-02T18:01:42.591000Z",
  "file_hash": "e97d73cca22125c3c227fe533f3b3cdb8493f036c3cd32b74e864cfd21ff4fe1",
  "private": false,
  "record": {
    "abstract": "This paper introduces quantum multiparty protocols which allow the use of\ntemporary assumptions. We prove that secure quantum multiparty computations are\npossible if and only if classical multi party computations work. But these\nstrict assumptions are necessary only during the execution of the protocol and\ncan be loosened after termination of the protocol.\n  We consider two settings:\n  1. A collusion of players tries to learn the secret inputs of honest players\nor tries to modify the result of the computation.\n  2. A collusion of players cheats in the above way or tries to disrupt the\nprotocol, i.e., the collusion tries to abort the computation or leaks\ninformation to honest players. We give bounds on the collusions tolerable after\na protocol has terminated and we state protocols reaching these bounds.",
    "arxiv_id": "quant-ph/0010112",
    "authors": [
      "J. Mueller-Quade",
      "H. Imai"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Temporary Assumptions for Quantum Multiparty Secure Computations",
    "url": "https://arxiv.org/abs/quant-ph/0010112"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "053613ad-efc7-4f96-906c-f0a93e5d519a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}