{
  "annotation_id": "2a5b29c8-7fc7-473b-a0f2-95969bd21374",
  "date_created": "2026-03-02T18:02:20.237000Z",
  "date_modified": "2026-03-02T18:02:20.237000Z",
  "file_hash": "e488f18b93dec71cba781e1b5e94acbe5aa6e3ed294a0262a9d60d394f7e11d3",
  "private": false,
  "record": {
    "abstract": "This paper proves that several interactive proof systems are zero-knowledge\nagainst quantum attacks. This includes a few well-known classical\nzero-knowledge proof systems as well as quantum interactive proof systems for\nthe complexity class HVQSZK, which comprises all problems having \"honest\nverifier\" quantum statistical zero-knowledge proofs. It is also proved that\nzero-knowledge proofs for every language in NP exist that are secure against\nquantum attacks, assuming the existence of quantum computationally concealing\ncommitment schemes. Previously no non-trivial proof systems were known to be\nzero-knowledge against quantum attacks, except in restricted settings such as\nthe honest-verifier and common reference string models. This paper therefore\nestablishes for the first time that true zero-knowledge is indeed possible in\nthe presence of quantum information and computation.",
    "arxiv_id": "quant-ph/0511020",
    "authors": [
      "John Watrous"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Zero-knowledge against quantum attacks",
    "url": "https://arxiv.org/abs/quant-ph/0511020"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2e412068-3e64-4ced-a048-e6376490c0e2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}