Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices

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

Paper 2019/1271

Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices

Martin R. Albrecht, Alex Davidson, 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 subexponential lattice hardness assumptions. Our protocol requires constructions of non-interactive zero-knowledge arguments of knowledge (NIZKAoK). Using recent developments in the area of post-quantum zero-knowledge arguments of knowledge, 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.

Note: Full version following PKC 2021 acceptance

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: A major revision of an IACR publication in PKC 2021
Keywords: oblivious pseudorandom function lattices post-quantum
Contact author(s): martin albrecht @ royalholloway ac uk
adavidson @ lip pt
amit deo @ ens-lyon fr
nigel smart @ kuleuven be
History: 2021-03-01: last of 3 revisions; 2019-11-05: received; See all versions
Short URL: https://ia.cr/2019/1271
License: CC BY

BibTeX

@misc{cryptoeprint:2019/1271,
      author = {Martin R.  Albrecht and Alex Davidson and Amit Deo and Nigel P.  Smart},
      title = {Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1271},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1271}
}