Pseudorandom Function-like States from Common Haar Unitary

TL;DR

This paper introduces a novel construction of pseudorandom function-like states in the quantum Haar random oracle model, enabling secure quantum cryptographic primitives without relying on one-way functions.

Contribution

It presents the first classically-accessible, adaptive secure PRFSG construction in the invertible Haar random oracle model, extending quantum cryptography capabilities.

Findings

Constructed PRFSGs are secure against unlimited queries.

The construction resembles classical Even-Mansour encryption.

First application of PRFSGs in the invertible QHRO model without assumptions.

Abstract

Recent active studies have demonstrated that cryptography without one-way functions (OWFs) could be possible in the quantum world. Many fundamental primitives that are natural quantum analogs of OWFs or pseudorandom generators (PRGs) have been introduced, and their mutual relations and applications have been studied. Among them, pseudorandom function-like state generators (PRFSGs) [Ananth, Qian, and Yuen, Crypto 2022] are one of the most important primitives. PRFSGs are a natural quantum analogue of pseudorandom functions (PRFs), and imply many applications such as IND-CPA secret-key encryption (SKE) and EUF-CMA message authentication code (MAC). However, only known constructions of (many-query-secure) PRFSGs are ones from OWFs or pseudorandom unitaries (PRUs). In this paper, we construct classically-accessible adaptive secure PRFSGs in the invertible quantum Haar random oracle (QHRO) model which is introduced in [Chen and Movassagh, Quantum]. The invertible QHRO model is an idealized model where any party can access a public single Haar random unitary and its inverse, which can be considered as a quantum analog of the random oracle model. Our PRFSG constructions resemble the classical Even-Mansour encryption based on a single permutation, and are secure against any unbounded polynomial number of queries to the oracle and construction. To our knowledge, this is the first application in the invertible QHRO model without any assumption or conjecture. The previous best construction in the idealized model is PRFSGs secure up to o({\lambda}/ log {\lambda}) queries in the common Haar state model [Ananth, Gulati, and Lin, TCC 2024].