Reproduce “Cryptography from Pseudorandom Quantum States” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Prabhanjan Ananth, Luowen Qian, Henry Yuen
A new cryptographic primitive, Pseudorandom Function-Like States (PRFS), is introduced and constructed from Pseudorandom Quantum States (PRS). This demonstrates that fundamental quantum cryptographic primitives, including statistically binding commitments and quantum pseudo one-time pads, can be based on PRS, thereby challenging the necessity of one-way functions in the quantum setting.
Key insights
- Pseudorandom Quantum States (PRS) are sufficient for foundational cryptographic primitives, suggesting they can serve as a cryptographic assumption potentially weaker than one-way functions.
- PRFS overcome the inherent rigidity and entanglement issues of raw PRS, providing a versatile and scalable primitive for quantum cryptographic design.
- A new extractor-based definition for statistical binding in quantum commitments robustly addresses potential quantum superposition attacks.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.