Quantum

Post-Quantum Perfect Zero-Knowledge Arguments for NP From Any One-Way Permutation

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 27/10/2026, 04:13:24 UTC.

Briefings

A new cryptographic paper demonstrates that post-quantum one-way permutations enable perfect zero-knowledge arguments for all NP problems, securing against quantum adversaries. The study establishes that the NOVY bit commitment scheme, built from any permutation using interactive hashing, is sum-binding and collapse-binding against quantum polynomial-time committers. This property allows Blum's perfect zero-knowledge argument for HAMCYCLE to maintain its quantum security guarantees. The research was published on arXiv in October 2026.

Key points

• The NOVY scheme is sum-binding and collapse-binding against quantum polynomial-time committers when the underlying permutation is a post-quantum one-way function.
• This property enables Blum's perfect zero-knowledge argument for HAMCYCLE to remain secure against quantum adversaries.

Context

This research addresses the need for post-quantum cryptography by proving that specific one-way permutations can support zero-knowledge arguments for NP problems, a significant advancement in cryptographic foundations.

Limitations

The evidence is limited to the arXiv preprint v1, which may not reflect final peer-reviewed results. Security claims against quantum adversaries are theoretical and depend on the permutation's properties. No specific implementation details, performance metrics, or real-world deployment data are provided.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 27/10/2026, 04:24:37 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeidzf3kyjmvrqk4y3u6j2kqtalnhzh7yc7lwqjmds7ebnew5vkalau