Welcome to the resource topic for 2022/1514
Title:
Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications
Authors: Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen
Abstract:Pseudorandom quantum states (PRS) are efficiently constructible states that are computationally indistinguishable from being Haar-random, and have recently found cryptographic applications. We explore new definitions, new properties and applications of pseudorandom states, and present the following contributions:
- New Definitions: We study variants of pseudorandom function-like state (PRFS) generators, introduced by Ananth, Qian, and Yuen (CRYPTO’22), where the pseudorandomness property holds even when the generator can be queried adaptively or in superposition. We show the feasibility of these variants assuming the existence of post-quantum one-way functions.
- Classical Communication: We show that PRS generators with logarithmic output length imply commitment and encryption schemes with classical communication. Previous constructions of such schemes from PRS generators required quantum communication.
- Simplified Proof: We give a simpler proof of the Brakerski-Shmueli (TCC’19) result that polynomially-many copies of uniform superposition states with random binary phases are indistinguishable from Haar-random states.
- Necessity of Computational Assumptions: We also show that a secure PRS with output length logarithmic, or larger, in the key length necessarily requires computational assumptions.
ePrint: https://eprint.iacr.org/2022/1514
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .