Cryptology ePrint Archive: Report 2019/1271

Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices

Martin R. Albrecht and Alex Davidson and Amit Deo and Nigel P. Smart

Abstract: Verifiable Oblivious Pseudorandom Functions (VOPRFs) are protocols that allow a client to learn verifiable pseudorandom function (PRF) evaluations on inputs of their choice. The PRF evaluations are computed by a server using their own secret key. The security of the protocol prevents both the server from learning anything about the client's input, and likewise the client from learning anything about the server's key. VOPRFs have many applications including password-based authentication, secret-sharing, anonymous authentication and efficient private set intersection. In this work, we construct the first round-optimal (online) VOPRF protocol that retains security from well-known lattice hardness assumptions. Our protocol requires constructions of non-interactive zero-knowledge arguments of knowledge (NIZKAoK). For analogues of Stern-type proofs in the lattice setting, we show that our VOPRF may be securely instantiated in the quantum random oracle model. We construct such arguments as extensions of prior work in the area of lattice-based zero-knowledge proof systems.

Category / Keywords: cryptographic protocols / oblivious pseudorandom function, lattices, post-quantum

Date: received 1 Nov 2019

Contact author: amit deo 2015 at rhul ac uk

Available format(s): PDF | BibTeX Citation

Version: 20191105:082113 (All versions of this report)

Short URL: ia.cr/2019/1271


[ Cryptology ePrint archive ]