Signatures From Pseudorandom States via $\bot$-PRFs
Mohammed Barhoush, Amit Behera, Lior Ozer, Louis Salvail and, Or Sattath

TL;DR
This paper introduces $ot$-PRG and $ot$-PRF, new cryptographic primitives based on quantum pseudorandomness, enabling quantum digital signatures with classical keys and tamper-resilient encryption.
Contribution
It defines $ot$-PRG and $ot$-PRF, constructs them from pseudo-deterministic PRGs, and applies these to create quantum digital signatures with classical keys and secure encryption.
Findings
Constructed $ot$-PRG from pseudo-deterministic PRG
Built $ot$-PRF from $ot$-PRG
Achieved quantum digital signatures with classical keys
Abstract
Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker than post-quantum one-way functions. Ananth, Lin, and Yuen (2023) have shown that logarithmic pseudorandom states can be used to construct a pseudo-deterministic PRG: informally, for a fixed seed, the output is the same with probability. In this work, we introduce new definitions for -PRG and -PRF. The correctness guarantees are that, for a fixed seed, except with negligible probability, the output is either the same (with probability ) or recognizable abort, denoted . Our approach admits a natural definition of multi-time PRG security, as well as the adaptive security of a PRF. We construct a -PRG from any pseudo-deterministic PRG and, from that, a -PRF.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cryptography and Data Security · Quantum Information and Cryptography
