safety security
One-Way Permutations Carry Perfect Zero Knowledge Past Quantum Attackers
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.
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.
Limits and context
- 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.
Key claims
A proof gives classical perfect zero-knowledge arguments for every NP statement from any post-quantum one-way permutation.
Qualification: That collapse-binding property then lets Blum's classical perfect-zero-knowledge argument for Hamiltonian cycle remain unchanged against quantum adversaries.
Evidence: source-2026-10-27-012
Sources
- arXiv preprint 2610.33185, original v1arXiv · primary research
Corrections
No corrections have been recorded for this story.