arXiv (All)
open access
Post-Quantum Perfect Zero-Knowledge Arguments for NP From Any One-Way Permutation
In this paper, we show for the first time that post-quantum one-way permutations are sufficient for perfect zero-knowledge classical arguments for all of NP with security guaranteed against quantum adversaries. We first establish that Naor, Ostrovsky,Venkatesen, and Yung's bit commitment scheme buil
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Quantum Approach For Reducing Communications in Classical Secure Computations with Long Outputs#1389024
- Time-space lower bounds for breaking quantum cryptography#1160915
- Time-space lower bounds for breaking quantum cryptography#1157449
- Beyond NISQ Assumptions: One-time Memory in the Classically Accessible Random-Oracle Model#1116934
- Multi-path Security in Quantum Networks with Trusted Nodes#1401299
Record · ID 1455666
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive