On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions
This work addresses foundational problems in quantum cryptography and hardware security, providing new insights and efficient constructions for researchers in these fields, though it appears incremental by building on existing concepts like PRS and qPUFs.
This paper tackles the problem of connecting quantum pseudorandomness with quantum hardware assumptions, specifically quantum physical unclonable functions (qPUFs), by showing that efficient pseudorandom quantum states (PRS) can construct universally unforgeable qPUFs, improving upon previous Haar-random state constructions, and demonstrating mutual constructions between qPUFs and quantum pseudorandom unitaries (PRUs).
This paper, for the first time, addresses the questions related to the connections between the quantum pseudorandomness and quantum hardware assumptions, specifically quantum physical unclonable functions (qPUFs). Our results show that the efficient pseudorandom quantum states (PRS) are sufficient to construct the challenge set for the universally unforgeable qPUF, improving the previous existing constructions that are based on the Haar-random states. We also show that both the qPUFs and the quantum pseudorandom unitaries (PRUs) can be constructed from each other, providing new ways to obtain PRS from the hardware assumptions. Moreover, we provide a sufficient condition (in terms of the diamond norm) that a set of unitaries should have to be a PRU in order to construct a universally unforgeable qPUF, giving yet another novel insight into the properties of the PRUs. Later, as an application of our results, we show that the efficiency of an existing qPUF-based client-server identification protocol can be improved without losing the security requirements of the protocol.