Cryptology ePrint Archive: Report 2012/182
How to Construct Quantum Random Functions
Abstract: In the presence of a quantum adversary, there are two possible definitions of security for a pseudorandom function. The first, which we call standard-security, allows the adversary to be quantum, but requires queries to the function to be classical. The second, quantum-security, allows the adversary to query the function on a quantum superposition of inputs, thereby giving the adversary a superposition of the values of the function at many inputs at once. Existing techniques for proving the security of pseudorandom functions fail when the adversary can make quantum queries. We give the first quantum-security proofs for pseudorandom functions by showing that some classical constructions of pseudorandom functions are quantum-secure. Namely, we show that the standard constructions of pseudorandom functions from pseudorandom generators or pseudorandom synthesizers are secure, even when the adversary can make quantum queries. We also show that a direct construction from lattices is quantum-secure. To prove security, we develop new tools to prove the indistinguishability of distributions under quantum queries.
In light of these positive results, one might hope that all standard-secure pseudorandom functions are quantum-secure. To the contrary, we show a separation: under the assumption that standard-secure pseudorandom functions exist, there are pseudorandom functions secure against quantum adversaries making classical queries, but insecure once the adversary can make quantum queries.
Category / Keywords: Quantum, Pseudorandom Function
Original Publication (with major differences): FOCS 2012
Date: received 4 Apr 2012, last revised 8 Oct 2013
Contact author: mzhandry at stanford edu
Available format(s): PDF | BibTeX Citation
Version: 20131008:161021 (All versions of this report)
Short URL: ia.cr/2012/182
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]