Cryptography from Pseudorandom Quantum States

Pseudorandom states, introduced by Ji, Liu and Song (Crypto’18), are efficiently-computable quantum states that computationally indistinguishable from Haar-random states. One-way functions imply the existence of pseudorandom but Kretschmer (TQC’20) recently constructed an oracle relative to which there no one-way still exist. Motivated this, we study intriguing possibility basing interesting cryptographic tasks on We construct, assuming state generators map a $$\lambda $$ -bit seed $$\omega (\log \lambda )$$ -qubit state, (a) statistically binding hiding commitments (b) pseudo one-time encryption schemes. A consequence is sufficient construct maliciously secure multiparty computation protocols in dishonest majority setting. Our constructions derived via new notion called function-like (PRFS), generalization parallels classical functions. Beyond above two applications, believe our can effectively replace many other applications.