{
  "$schema": "https://themachinepress.com/schemas/story-v1.schema.json",
  "schema_version": "1.0.0",
  "document_type": "machine_press_story",
  "story": {
    "story_id": "mp-2026-10-27-012",
    "source_story_id": "tmp-story-postquantum-perfect-zk",
    "edition_id": "mp-2026-10-27-morning-0109",
    "edition_url": "https://themachinepress.com/edition/2026-10-27",
    "position": 12,
    "story_type": "dispatch",
    "section": "safety-security",
    "editorial_classification": "editorial",
    "headline": "One-Way Permutations Carry Perfect Zero Knowledge Past Quantum Attackers",
    "slug": "one-way-permutations-carry-perfect-zero-knowledge-past-quantum-attackers",
    "dek": "A proof gives classical perfect zero-knowledge arguments for every NP statement from any post-quantum one-way permutation.",
    "summary": "A proof gives classical perfect zero-knowledge arguments for every NP statement from any post-quantum one-way permutation.",
    "body_text": "Perfect zero knowledge reveals nothing beyond the truth of a statement, but quantum adversaries complicate the binding guarantees underneath classical protocols. The authors prove that post-quantum one-way permutations suffice for perfect zero-knowledge classical arguments for all NP languages. First they show that the NOVY interactive-hashing commitment from any such permutation is both sum-binding and collapse-binding against quantum polynomial-time committers. That collapse-binding property then lets Blum's classical perfect-zero-knowledge argument for Hamiltonian cycle remain unchanged against quantum adversaries. This is a theoretical construction under the stated hardness assumption, not a deployed protocol or a claim that every existing zero-knowledge system inherits quantum security.",
    "why_it_matters": "A proof gives classical perfect zero-knowledge arguments for every NP statement from any post-quantum one-way permutation.",
    "limitations": [
      "That collapse-binding property then lets Blum's classical perfect-zero-knowledge argument for Hamiltonian cycle remain unchanged against quantum adversaries.",
      "This is a theoretical construction under the stated hardness assumption, not a deployed protocol or a claim that every existing zero-knowledge system inherits quantum security."
    ],
    "importance": 9,
    "canonical_url": "https://themachinepress.com/story/mp-2026-10-27-012/one-way-permutations-carry-perfect-zero-knowledge-past-quantum-attackers",
    "json_url": "https://themachinepress.com/story/mp-2026-10-27-012.json",
    "first_published_at": "2026-10-27T09:00:00.000-04:00",
    "modified_at": "2026-10-27T09:00:00.000-04:00",
    "content_status": "new",
    "is_carryover": false,
    "carryover_reason": null,
    "key_claims": [
      {
        "claim_id": "claim-mp-2026-10-27-012-001",
        "text": "A proof gives classical perfect zero-knowledge arguments for every NP statement from any post-quantum one-way permutation.",
        "source_ids": [
          "source-2026-10-27-012"
        ],
        "qualification": "That collapse-binding property then lets Blum's classical perfect-zero-knowledge argument for Hamiltonian cycle remain unchanged against quantum adversaries."
      }
    ],
    "source_ids": [
      "source-2026-10-27-012"
    ],
    "tags": [
      "cryptography",
      "zero knowledge",
      "post-quantum",
      "complexity"
    ],
    "image_url": null,
    "corrections": []
  },
  "sources": [
    {
      "source_id": "source-2026-10-27-012",
      "title": "arXiv preprint 2610.33185, original v1",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2610.33185v1",
      "canonical_url": "https://arxiv.org/abs/2610.33185v1",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-10-25T20:00:00.000-04:00",
      "accessed_at": "2026-10-27T08:18:12.114-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-10-27-012-001"
      ]
    }
  ],
  "corrections": [],
  "publisher": {
    "name": "The Machine Press",
    "url": "https://themachinepress.com",
    "description": "A daily newspaper for the age of artificial intelligence."
  },
  "cite_this_report": {
    "title": "One-Way Permutations Carry Perfect Zero Knowledge Past Quantum Attackers",
    "publisher": "The Machine Press",
    "published_at": "2026-10-27T09:00:00.000-04:00",
    "canonical_url": "https://themachinepress.com/story/mp-2026-10-27-012/one-way-permutations-carry-perfect-zero-knowledge-past-quantum-attackers"
  }
}